CONFLICT RESOLUTION ALGORITHM FOR INTERCONNECTION NETWORKS.

Zhixi Fang, Jitender 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

Coloring
Computational complexity
Polynomials

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.

CONFLICT RESOLUTION ALGORITHM FOR INTERCONNECTION NETWORKS. / Fang, Zhixi; Deogun, Jitender S.

Unknown Host Publication Title. ACM, 1985.

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

Fang, Z & Deogun, JS 1985, CONFLICT RESOLUTION ALGORITHM FOR INTERCONNECTION NETWORKS. in Unknown Host Publication Title. ACM.
Fang Z, Deogun JS. CONFLICT RESOLUTION ALGORITHM FOR INTERCONNECTION NETWORKS. In Unknown Host Publication Title. ACM. 1985
Fang, Zhixi ; Deogun, Jitender S. / CONFLICT RESOLUTION ALGORITHM FOR INTERCONNECTION NETWORKS. Unknown Host Publication Title. ACM, 1985.
@inproceedings{676aa690b1f84c1abfad693ca7605c42,
title = "CONFLICT RESOLUTION ALGORITHM FOR INTERCONNECTION NETWORKS.",
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.",
author = "Zhixi Fang and Deogun, {Jitender S}",
year = "1985",
month = "12",
day = "1",
language = "English (US)",
isbn = "0897911504",
publisher = "ACM",
booktitle = "Unknown Host Publication Title",

}

TY - GEN

T1 - CONFLICT RESOLUTION ALGORITHM FOR INTERCONNECTION NETWORKS.

AU - Fang, Zhixi

AU - Deogun, Jitender S

PY - 1985/12/1

Y1 - 1985/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022235135&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022235135&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0897911504

BT - Unknown Host Publication Title

PB - ACM

ER -