A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works

DOI10.1016/S0166-218X(99)00048-7MaRDI QIDQ1304467zbMATH OpenOpenAlexWikidataFDO

Authors Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe

Publication date 23 November 1999

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00048-7

zbMATH Keywords

planar networksPlaNet

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 780786
• On shortest disjoint paths in planar graphs
• On shortest disjoint paths in planar graphs
• Length-bounded disjoint paths in planar graphs

Cites work

• A linear-time algorithm for a special case of disjoint set union
• A linear-time algorithm for edge-disjoint paths in planar graphs
• Algorithms for routing in planar graphs
• An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
• scientific article; zbMATH DE number 437535 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 43417 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1006119 (Why is no real title available?)
• scientific article; zbMATH DE number 780786 (Why is no real title available?)
• Multicommodity flows in planar graphs
• OPTIMAL ROUTING THROUGH DENSE CHANNELS
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Routing through a Dense Channel with Minimum Total Wire Length
• The Vertex-Disjoint Menger Problem in Planar Graphs

Cited in

(2)

• PlaNet
• Revisiting directed disjoint paths on tournaments (and relatives)

Describes a project that uses

Uses Software

• LEDA
• Eiffel

This page was built for publication: A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works

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