Fast Algorithms for Shortest Paths in Planar Graphs, with Applications

A note on two problems in connexion with graphs

1959 • 22,492 citations

Graph theory

1969 • 11,244 citations

The Design and Analysis of Computer Algorithms

1974 • 9,688 citations

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

1972 • 2,450 citations

Problem-Solving Methods in Artificial Intelligence

1971 • 1,638 citations

A Separator Theorem for Planar Graphs

1979 • 1,381 citations

Efficient Algorithms for Shortest Paths in Sparse Networks

1977 • 1,039 citations

Applications of a Planar Separator Theorem

1980 • 667 citations

Generalized Nested Dissection

1979 • 561 citations

Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications

1985 • 383 citations

Shortest‐path algorithms: Taxonomy and annotation

1984 • 317 citations

Decomposition of Km,n(Km,n∗) into cycles (circuits) of length 2k

1981 • 174 citations

Maximum Flow in Planar Networks

1979 • 125 citations

Maximum flow in (s,t) planar networks

1981 • 108 citations

Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time

1983 • 92 citations

An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks

1985 • 55 citations

A generalized permanent label setting algorithm for the shortest path between specified nodes

1972 • 43 citations

An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks

1985 • 40 citations

On multicommodity flows in planar graphs

1984 • 21 citations

Minimum s-t cut of a planar undirected network in o(n log2(n)) time

1981 • 21 citations

Shortest path problems in planar graphs

1983 • 12 citations