Transformation models of directed cyclic graph onto acyclic graph and mapping for task assignment problem
Task assignment is one of the most challenging problems in distributed computing environment. Several approaches and techniques of optimal task assignment have been proposed by various researchers, ranging from graph partitioning-based tools to heuristic graph matching. A good task assignment algori...
Saved in:
Main Author: | Ariffin, Wan Nor Munirah |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/102332/1/WanNorMunirahPFS2021.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On some packing and partition problems in geometric graphs
by: Trao, Hazim Michman
Published: (2018) -
The performance of form four science students in selected tasks on graphs /
by: Lim, Geok Cheng
Published: (1995) -
Compatible pairs of actions for finite cyclic 2-groups and the associated compatible action graphs
by: Sahimel Azwal, Sulaiman
Published: (2018) -
On the skewness of graphs /
by: Sim, Kai An
Published: (2014) -
Planar Graphs And Coloring
by: Manogaran, Lavaneesvari
Published: (2010)