Multicolor routing in the undirected hypercube

DOI10.1016/S0166-218X(99)00189-4MaRDI QIDQ1971219zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Routing a permutation in the hypercube by two sets of edge disjoint paths
• New results on two hypercube coloring problems
• Routing and path multicoloring
• scientific article; zbMATH DE number 1420909
• On Disjoint Shortest Paths Routing on the Hypercube

Cites work

• Counterexample to a conjecture of Szymanski on hypercube routing
• Efficient routing in all-optical networks
• scientific article; zbMATH DE number 1003273 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 910915 (Why is no real title available?)
• scientific article; zbMATH DE number 3225079 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Multicolor routing in the undirected hypercube
• On Edge Coloring Bipartite Graphs
• Rearrangeable circuit-switched hypercube architectures for routing permutations
• Routing a permutation in the hypercube by two sets of edge disjoint paths
• Routings for involutions of a hypercube

Cited in

(3)

• Multicolor routing in the undirected hypercube
• Routing multiple paths in hypercubes
• 2-1 routing requests in the hypercube

This page was built for publication: Multicolor routing in the undirected hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971219)