Maintenance of a minimum spanning forest in a dynamic plane graph
- 31 March 1992
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 13 (1), 33-54
- https://doi.org/10.1016/0196-6774(92)90004-v
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Finding paths and deleting edges in directed acyclic graphsInformation Processing Letters, 1988
- A topological approach to dynamic graph connectivityInformation Processing Letters, 1987
- Amortized efficiency of a path retrieval data structureTheoretical Computer Science, 1986
- Self-adjusting binary search treesJournal of the ACM, 1985
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- On-line computation of transitive closures of graphsInformation Processing Letters, 1983
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Efficient Planarity TestingJournal of the ACM, 1974