Linear verification for spanning trees
- 1 March 1985
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 5 (1) , 57-65
- https://doi.org/10.1007/bf02579443
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A linear time algorithm for the lowest common ancestors problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Information Bounds Are Weak in the Shortest Distance ProblemJournal of the ACM, 1980
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975