Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically 
Defined Graphs

Lengauer, Thomas

doi:10.1016/0196-6774(87)90042-3

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Lengauer, T. (1987). Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs. Journal of Algorithms, 8(2), 260-284. doi:10.1016/0196-6774(87)90042-3.

Cite as: https://hdl.handle.net/21.11116/0000-000F-8F69-B

Abstract

There is no abstract available