Cuts and Disjoint Paths in the Valley-Free Path Model

DOI10.1080/15427951.2006.10129126zbMath1144.68337MaRDI QIDQ5384925

Alexander Hall, Erlebach, Thomas, 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

directed graph; acyclic graphs

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

68W25: Approximation algorithms

05C20: Directed graphs (digraphs), tournaments

Related Items

Routing regardless of network stability