Pairwise edge disjoint shortest paths in the \(n\)-cube

DOI10.1016/J.TCS.2006.07.058zbMath1140.68053OpenAlexW2029564481MaRDI QIDQ861284

David Serena, Teofilo F. Gonzalez

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.058

zbMATH Keywords

hypercube\(n\)-cube\(NP\)-completenessedge disjoint shortest paths

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Pairwise edge disjoint shortest paths in the \(n\)-cube ⋮ Multicasting in the hypercube, chord and binomial graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of pairwise shortest path routing in the grid
• Pairwise edge disjoint shortest paths in the \(n\)-cube
• Counterexample to a conjecture of Szymanski on hypercube routing

This page was built for publication: Pairwise edge disjoint shortest paths in the \(n\)-cube