|
12
|
I/O-Efficient Algorithms for Shortest Path Related Problems
– Norbert Ralf Zeh
- 2002
|
|
|
Planarity Testing and Embedding
– Pier Francesco Cortese, Maurizio Patrignani
- 2004
|
|
|
Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs
– Sairam Subramanian, Sairam Subramanian, Philip N. Klein, Roberto Tamassia, Jeffrey S. Vitter
- 1995
|
|
1
|
Planarity Algorithms via PQ-Trees
– Bernhard Haeupler, Robert E. Tarjan
- 2008
|
|
1
|
I/O-Optimal Planar Embedding Using Graph Separators
– Norbert Zeh
- 2001
|
|
21
|
Path-based depth-first search for strong and biconnected components
– Harold N. Gabow
- 2000
|
|
3
|
Data Structures for Two-Edge Connectivity in Planar Graphs
– John Hershberger, Monika Rauch, Subhash Suri
- 1994
|
|
16
|
A Linear Algorithm for Analysis of Minimum Spanning and Shortest Path Trees of Planar Graphs
– Heather Booth, Jeffery Westbrook
- 1992
|
|
10
|
Unique Maximum Matching Algorithms
– Harold N. Gabow, Haim Kaplan, Robert E. Tarjan
- 2002
|
|
3
|
I/O-Efficient Planar Separators and Applications
– Norbert Zeh
- 2001
|
|
46
|
Planar Separators and Parallel Polygon Triangulation
– Michael T. Goodrich
- 1992
|
|
|
Simplified O(n) Planarity Algorithms
– John M. Boyer, Wendy Myrvold
- 2001
|
|
|
PQ Trees, PC Trees, and Planar Graphs
– Wen-Lian Hsu, Ross M. McConnell
- 2001
|
|
1
|
Fully Dynamic Maintenance of k-Connectivity in Parallel
– Weifa Liang, Senior Member, Richard P. Brent, Hong Shen
|
|
62
|
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
|
|
8
|
Revised version of "Efficient Cross-Trees for External Memory"
– Roberto Grossi, Giuseppe F. Italiano, Roberto Grossi
- 2000
|
|
6
|
Fully Dynamic Biconnectivity in Graphs
– M. R. Henzinger
- 1992
|
|
|
Linear-time algorithms to color topological graphs
– Warren D. Smith
- 2005
|
|
|
Algorithm and Experiments in Testing Planar . . .
– Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
- 2004
|
