@inproceedings{2816b4173f07421db293354ebbd2b0e0,

title = "HEURISTIC ALGORITHM FOR CONFLICT RESOLUTION PROBLEM IN MULTISTAGE INTERCONNECTION NETWORKS.",

abstract = "A graph model called a conflict graph is presented to describe the conflict-resolution problem in multistage interconnection networks. The properties of the conflict graph are investigated, and it is shown that the conflict-resolution problem is equivalent to the node-coloring problem in the conflict graph. A heuristic algorithm with performance P(G) equals O(log//2 N) is developed, offering a considerable improvement over the bounds of the currently best algorithm known.",

author = "Deogun, {Jitender S.} and Zhixi Fang",

year = "1987",

language = "English (US)",

isbn = "0271006080",

series = "Proceedings of the International Conference on Parallel Processing",

publisher = "Pennsylvania State Univ Press",

pages = "475--478",

editor = "Sahni, {Sartaj K.}",

booktitle = "Proceedings of the International Conference on Parallel Processing",

note = "Proc Int Conf Parallel Process 1987 ; Conference date: 17-08-1987 Through 21-08-1987",

}