|
265
|
A data structure for dynamic trees
– D D Sleator, R E Tarjan
- 1983
|
|
139
|
Data structures for on-line updating of minimum spanning trees
– G N Frederickson
- 1983
|
|
25
|
Separator Based Sparsification for Dynamic Planar Graph Algorithms
– D Eppstein, Z Galil, G F Italiano, T Spencer
- 1993
|
|
110
|
Sparsification — A technique for speeding up dynamic graph algorithms
– D Eppstein, Z Galil, G F Italiano, A Nissenzweig
- 1997
|
|
19
|
E cient algorithms for graphic matroid intersection and parity
– H N Gabow, M Stallman
- 1985
|
|
73
|
Ambivalent Data Structures For Dynamic 2-Edge-Connectivity And k Smallest Spanning Trees
– Greg N. Frederickson
- 1991
|
|
107
|
Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree
– Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
- 1997
|
|
32
|
Improved Data Structures for Fully Dynamic Biconnectivity
– M Rauch
- 1994
|
|
883
|
Graph theory
– F Harary
- 1969
|
|
338
|
A Separator Theorem for Planar Graphs f
– Richard J. Lipton, Robert E. Tarjan
- 1977
|
|
1611
|
Computational geometry: An introduction
– F P Preparata, M I Shamos
- 1985
|
|
102
|
A linear algorithm for embedding planar graphs using PQ-trees
– N Chiba, T Nishizeki, S Abe, T Ozawa
- 1985
|
|
25
|
Dynamic expression trees and their applications
– R F Cohen, R Tamassia
- 1991
|
|
63
|
Finding minimum spanning trees
– D Cheriton, R Tarjan
- 1976
|
|
42
|
Near-optimal fully-dynamic graph connectivity
– M Thorup
- 2000
|
|
119
|
The cell probe complexity of dynamic data structures
– Michael L Fredman, Michael E Saks
- 1989
|
|
141
|
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
– M L Fredman, D E Willard
- 1990
|
|
46
|
Dynamic Trees and Dynamic Point Location
– Michael T. Goodrich, Roberto Tamassia
- 1991
|
|
147
|
Optimal point location in a monotone subdivision
– Herbert Edelsbrunner, Leonidas J Guibas, Jorge Stolfi
- 1986
|
