This paper introduces a graph model, conflict graph, to represent the conflict resolution problem in multistage interconnection networks. This model shows that the conflict resolution problem is NP-complete, since it is equivalent to node coloring problem in conflict graph. Three heuristic polynomial algorithms for conflict resolution are presented.
|Original language||English (US)|
|Title of host publication||Unknown Host Publication Title|
|Number of pages||1|
|State||Published - 1985|
ASJC Scopus subject areas