scientific article; zbMATH DE number 1263226

MaRDI QIDQ4234098zbMATH OpenFDO

Authors Zvi Galil, Xiang Dong Yu

Publication date 30 January 2002

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Short length Menger's theorem and reliable optical routing
• scientific article; zbMATH DE number 3845615
• scientific article; zbMATH DE number 4059450
• Menger-type theorems with restrictions on path lengths

Cited in

(16)

• On strong Menger-connectivity of star graphs
• Short proof of Menger's theorem
• Increasing distances in graphs
• On edge-disjoint spanning trees with small depths
• A note on k-shortest paths problem
• Labeled cuts in graphs
• scientific article; zbMATH DE number 4059450 (Why is no real title available?)
• scientific article; zbMATH DE number 637527 (Why is no real title available?)
• Recent developments in maximum flow algorithms
• Fast augmenting paths by random sampling from residual graphs
• Short length Menger's theorem and reliable optical routing
• Optimal parallel routing in star graphs (extended abstract)
• Menger-type theorems with restrictions on path lengths
• A short proof and experimental study of the approximation algorithm for label s-t cut
• Faster algorithm for second (s,t)-mincut and breaking quadratic barrier for dual edge sensitivity for (s,t)-mincut
• A short proof and experimental study of the approximation algorithm for label s-t Cut

This page was built for publication:

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