An optimal O(NlgN) algorithm for permutation admissibility to extra-stage cube-type networks

DOI10.1109/12.464393zbMath1053.68510OpenAlexW2169641487MaRDI QIDQ4421190

Xiao-Jun Shen

Publication date: 1995

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.464393

zbMATH Keywords

graph coloringconflict graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

GSE: a full-access multistage interconnection network of arbitrary size ⋮ Exploiting colored Petri nets to decide on permutation admissibility

This page was built for publication: An optimal O(NlgN) algorithm for permutation admissibility to extra-stage cube-type networks