Disjoint paths in hypercubes with prescribed origins and lengths
From MaRDI portal
Publication:5747712
DOI10.1080/00207160802566805zbMath1221.05216OpenAlexW2103539369MaRDI QIDQ5747712
S. Lavanya, Sheshayya A. Choudum, V. Sunitha
Publication date: 14 September 2010
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160802566805
Network design and communication in computer systems (68M10) Paths and cycles (05C38) Distance in graphs (05C12)
Related Items (7)
Algorithms for finding disjoint path covers in unit interval graphs ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Fault tolerance of hypercube like networks: spanning laceability under edge faults ⋮ Embedding double starlike trees into hypercubes ⋮ Embedding a subclass of trees into hypercubes ⋮ Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs ⋮ One-to-one disjoint path covers on multi-dimensional tori
Cites Work
This page was built for publication: Disjoint paths in hypercubes with prescribed origins and lengths