The matching technique of directed cyclic graph for task assignment problem
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 comm...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
AIP Publishing
2014
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/62982/ http://dx.doi.org/10.1063/1.4903612 http://dx.doi.org/10.1063/1.4903612 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|