Cuts and Disjoint Paths in the Valley-Free Path Model

DOI10.1080/15427951.2006.10129126MaRDI QIDQ5384925zbMATH OpenOpenAlexFDO

Authors Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinović Greetham

Publication date 29 April 2008

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15427951.2006.10129126

zbMATH Keywords

acyclic graphsdirected graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• On the disjoint paths problem
• Connectivity Measures for Internet Topologies on the Level of Autonomous Systems
• Maximum flows on disjoint paths
• Algorithms for 2-Route Cut Problems
• scientific article; zbMATH DE number 871922

This page was built for publication: Cuts and Disjoint Paths in the Valley-Free Path Model

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