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

DOI10.1016/S0166-218X(99)00048-7zbMath0935.68130OpenAlexW2095648765WikidataQ127087506 ScholiaQ127087506MaRDI QIDQ1304467

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

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

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

Related Items (1)

PlaNet

Uses Software

• LEDA
• Eiffel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for a special case of disjoint set union
• Algorithms for routing in planar graphs
• Multicommodity flows in planar graphs
• A linear-time algorithm for edge-disjoint paths in planar graphs
• Routing through a Dense Channel with Minimum Total Wire Length
• An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• OPTIMAL ROUTING THROUGH DENSE CHANNELS
• The Vertex-Disjoint Menger Problem in Planar Graphs

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