scientific article; zbMATH DE number 780786

MaRDI QIDQ4840776zbMATH OpenFDO

Authors Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe

Publication date 11 March 1996

zbMATH Keywords

algorithmscapacitydisjoint pathsplanar graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Programming involving graphs or networks (90C35)

Recommendations

• A linear-time algorithm for edge-disjoint paths in planar graphs
• The Vertex-Disjoint Menger Problem in Planar Graphs
• scientific article; zbMATH DE number 437535
• scientific article; zbMATH DE number 833804
• scientific article; zbMATH DE number 1354125

Cited in

(20)

• A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works
• Length-bounded disjoint paths in planar graphs
• A linear-time algorithm for edge-disjoint paths in planar graphs
• An algorithm for node-capacitated ring routing
• Algorithms for finding disjoint path covers in unit interval graphs
• scientific article; zbMATH DE number 3858436 (Why is no real title available?)
• scientific article; zbMATH DE number 4205963 (Why is no real title available?)
• Irrelevant vertices for the planar disjoint paths problem
• A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs
• scientific article; zbMATH DE number 4091555 (Why is no real title available?)
• scientific article; zbMATH DE number 16298 (Why is no real title available?)
• scientific article; zbMATH DE number 475595 (Why is no real title available?)
• scientific article; zbMATH DE number 833766 (Why is no real title available?)
• Efficient algorithms for minimal disjoint path problems on chordal graphs
• LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS
• An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
• An exponential time parameterized algorithm for planar disjoint paths
• I/O-efficient path traversal in succinct planar graphs
• Improved approximation for node-disjoint paths in planar graphs
• The edge-disjoint paths problem is NP-complete for series-parallel graphs

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 Q4840776)