Maintenance of a minimum spanning forest in a dynamic plane graph

Journal of Algorithms

Volumn 13, Issue 1, 1992, Pages 33-54

  Eppstein, David ^a   Italiano, Giuseppe F ^b   Tamassia, Roberto ^c   Tarjan, Robert E ^d,e   Westbrook, Jeffery ^f   Yung, Moti ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c BROWN UNIVERSITY   (United States)

^d PRINCETON UNIVERSITY   (United States)

^e NEC LABORATORIES AMERICA   (United States)

^f YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249015356     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/0196-6774(92)90004-V     Document Type: Article

References (34)

1. Incremental algorithms for minimal length paths
2. Incremental planarity testing
3. On-line Planarity Testing
4. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
5. Finding minimum spanning trees
6. A linear algorithm for embedding planar graphs using PQ-trees
7. Algorithms for updating minimum spanning trees
8. Updating distances in dynamic graphs
9. An on-line edge deletion problem
10. Data structures for on-line updating of minimum spanning trees, with applications
11. Efficient algorithms for graphic matroid intersection and parity (extended abstract)
12. Use of dynamic trees in a network simplex algorithm for the maximum flow problem
13. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
14. Efficient planarity testing
15. On-line computation of transitive closure for graphs
16. Amortized efficiency of a path retrieval data structure
17. Finding paths and deleting edges in directed acyclic graphs
18. Dynamic data structures for series parallel digraphs
19. Maintenance of transitive closure and transitive reduction of graphs
20. Decision trees and random access machines
21. Fully dynamic techniques for point location and transitive closure in planar structures
22. A topological approach to dynamic graph connectivity
23. A dynamization of the all pairs least cost path problem
24. A data structure for dynamic trees
25. Self-adjusting binary search trees
26. On finding and updating spanning trees and shortest paths
27. A dynamic data structure for planar graph embedding
28. Sensitivity analysis of minimum spanning trees and shortest path trees
29. Amortized computational complexity
30. A Dynamic Transitive Closure Algorithm