Multicolor routing in the undirected hypercube

DOI10.1016/S0166-218X(99)00189-4zbMath0948.68134OpenAlexW2044166824WikidataQ128066659 ScholiaQ128066659MaRDI QIDQ1971219

Hisao Tamaki, Qian-Ping Gu

Publication date: 22 November 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00189-4

zbMATH Keywords

undirected routing problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Multicolor routing in the undirected hypercube

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counterexample to a conjecture of Szymanski on hypercube routing
• Rearrangeable circuit-switched hypercube architectures for routing permutations
• Routings for involutions of a hypercube
• Routing a permutation in the hypercube by two sets of edge disjoint paths
• Multicolor routing in the undirected hypercube
• Efficient routing in all-optical networks
• On Edge Coloring Bipartite Graphs