The matching technique of directed cyclic graph for task assignment problem

Abstract

In this paper, the theoretical graph application using matching is presented to assign a number of tasks onto two processors. The problem involves cycles, which concerns finding directed acyclic graph by arranging the nodes onto multicolumn inspired by DPillar and presenting their edges to show communication between the nodes. A co-comparability graph is presented in order to assign the task onto two processors. The quality techniques used for finding the acyclic graph and co-comparability graph lead to an efficient graph-mapping concept.