A Linear Algorithm for Analysis of Minimum Spanning and Shortest Path Trees of Planar Graphs (1992)

Cached

Download Links

by Heather Booth , Jeffery Westbrook
Venue:Algorithmica
Citations:16 - 0 self

Active Bibliography

6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
68 Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph – David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert E. Tarjan, Jeffery Westbrook, Moti Yung - 1992
Persistence, Offline Algorithms, and Space Compaction – David Eppstein - 1991
13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
Constrained Planarity • Deletion and Partition Problems • – Maurizio Patrignani, Upward Planarity Outerplanarity
1 Planarity Testing and Embedding – Pier Francesco Cortese, Maurizio Patrignani - 2004
17 Offline Algorithms for Dynamic Minimum Spanning Tree Problems – David Eppstein - 1994
18 Finding the k Smallest Spanning Trees – David Eppstein - 1992
19 Swapping a failing edge of a single source shortest paths tree is good and fast – Enrico Nardelli, Guido Proietti, Peter Widmayer - 1999
83 Ambivalent Data Structures For Dynamic 2-Edge-Connectivity And k Smallest Spanning Trees – Greg N. Frederickson - 1991
27 Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators – Adam L. Buchsbaum , Haim Kaplan, Anne Rogers, Jeffery R. Westbrook - 1998
55 Dynamic Graph Algorithms – David Eppstein, Zvi Galil, Giuseppe F. Italiano - 1999
76 Nearest Common Ancestors: A survey and a new distributed algorithm – Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe - 2002
2 Combine and Conquer – Robert F. Cohen, Robert F. Cohen, Roberto Tamassia, Roberto Tamassia - 1992
4 Improved Data Structures for Fully Dynamic Biconnectivity – Monika Rauch Henzinger - 1997
3 I/O-Efficient Planar Separators and Applications – Norbert Zeh - 2001
6 Fully Dynamic Biconnectivity in Graphs – M. R. Henzinger - 1992
3 Data Structures for Two-Edge Connectivity in Planar Graphs – John Hershberger, Monika Rauch, Subhash Suri - 1994
17 An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem – Jiazhen Cai, Xiaofeng Han, Robert E. Tarjan - 1993