J. A. La Poutre. Dynamic graph algorithms and data structures. Phd thesis, Department of Computer Science, Utrecht University, 1991. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Bounded Degree Spanning Trees - Strothmann (1 citation) (Correct)
Bounded Degree Spanning Trees - Strothmann (1 citation) (Correct)
Maintaining Center and Median in Dynamic Trees - Alstrup, Holm, Thorup (2000) (3 citations) (Correct)
Fully Dynamic Planarity Testing with Applications - Galil, Italiano, Sarnak (1992) (Correct)
Separator-Based Sparsification II: Edge And Vertex.. - Eppstein, Galil.. (1998) (Correct)
Undirected Vertex-Connectivity Structure and Smallest.. - Hsu (1995) (3 citations) (Correct)
Combine and Conquer - Cohen, Tamassia (1992) (1 citation) (Correct)
The P-range tree: A new data structure for range searching.. - Subramanian, al. (1995) (Correct)
Certificates and Fast Algorithms for Biconnectivity in.. - Henzinger, Poutré (1997) (6 citations) (Correct)
Two Linear Time Union-Find Strategies for Image Processing - Fiorio, Gustedt (1994) (14 citations) (Correct)
On Finding Minimal Two-Connected Subgraphs - Kelsen, Ramachandran (1992) (5 citations) (Correct)
Combine and Conquer - Cohen (1992) (1 citation) (Correct)
Fast Incremental Planarity Testing - Westbrook (1992) (12 citations) (Correct)
Decremental Biconnectivity on Planar Graphs - Lukovszki, Strothman (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC