Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
- 30 June 1987
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 8 (2) , 260-284
- https://doi.org/10.1016/0196-6774(87)90042-3
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- Hierarchical planarity testing algorithmsPublished by Springer Nature ,1986