Wide diameter and minimum length of disjoint Menger path systems

DOI10.1002/NET.20079zbMath1086.05025OpenAlexW4248868391MaRDI QIDQ3367054

Toru Kojima

Publication date: 23 January 2006

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20079

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (3)

Node-disjoint paths in hierarchical hypercube networks ⋮ Node-disjoint paths in a level block of generalized hierarchical completely connected networks ⋮ Wide diameter and minimum length of disjoint Menger path systems

Cites Work

• Wide diameter and minimum length of disjoint Menger path systems
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Stronger bounds for generalized degress and Menger path systems

This page was built for publication: Wide diameter and minimum length of disjoint Menger path systems