Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 153-170
- https://doi.org/10.1007/3-540-16078-7_73
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- The complexity of compacting hierarchically specified layouts of integrated circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982