Universiti Teknologi Malaysia Institutional Repository

The matching technique of directed cyclic graph for task assignment problem

Ariffin, Wan Nor Munirah and Salleh, Shaharuddin (2014) The matching technique of directed cyclic graph for task assignment problem. AIP Conference Proceedings, 1635 . pp. 387-394. ISSN 0094-243X

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1063/1.4903612

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.

Item Type:Article
Uncontrolled Keywords:cyclic graph, graph-mapping
Subjects:Q Science
Divisions:Science
ID Code:62982
Deposited By: Fazli Masari
Deposited On:03 Oct 2017 15:08
Last Modified:03 Oct 2017 15:08

Repository Staff Only: item control page