A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
- 1 April 1994
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 11 (4) , 341-352
- https://doi.org/10.1007/bf01187017
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear TimeSIAM Journal on Computing, 1992
- Maintenance of a minimum spanning forest in a dynamic plane graphJournal of Algorithms, 1992
- Finding the k smallest spanning treesPublished by Springer Nature ,1990
- Deques with heap orderInformation Processing Letters, 1986
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- A linear algorithm for embedding planar graphs using PQ-treesJournal of Computer and System Sciences, 1985
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Efficient Planarity TestingJournal of the ACM, 1974