Edge Disjoint Paths in Moderately Connected Graphs

DOI10.1007/11786986_19zbMath1223.05143OpenAlexW1695709836MaRDI QIDQ5901483

No author found.

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.5720

zbMATH Keywords

undirected graphsglobal minimum cutasymptotically large minorsedge didjoint paths problemEDP problemhigh diameterspolylogarithmic approximation algorithm

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (1)

Disjoint paths in sparse graphs

This page was built for publication: Edge Disjoint Paths in Moderately Connected Graphs