𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for routing in planar graphs

✍ Scribed by M. Becker; K. Mehlhorn

Publisher
Springer-Verlag
Year
1986
Tongue
English
Weight
635 KB
Volume
23
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Faster Shortest-Path Algorithms for Plan
Faster Shortest-Path Algorithms for Planar Graphs
✍ Monika R Henzinger; Philip Klein; Satish Rao; Sairam Subramanian πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 445 KB

We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. For the case where negative edge-lengths are allowed, we gi

An algorithm for drawing planar graphs
An algorithm for drawing planar graphs
✍ Bor Plestenjak πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 382 KB πŸ‘ 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s