CONFLICT RESOLUTION ALGORITHM FOR INTERCONNECTION NETWORKS.

Zhixi Fang, J. S. Deogun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherACM
Number of pages1
ISBN (Print)0897911504
StatePublished - Dec 1 1985

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Fang, Z., & Deogun, J. S. (1985). CONFLICT RESOLUTION ALGORITHM FOR INTERCONNECTION NETWORKS. In Unknown Host Publication Title ACM.