Computing Minimal Spanning Subgraphs in Linear Time

Han, Xiaofeng; Kelsen, Pierre; Ramachandran, Vijaya; Tarjan, Robert E.

doi:10.1137/S0097539791224509

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Computing Minimal Spanning Subgraphs in Linear Time

MPS-Authors

/persons/resource/persons44755

Kelsen, Pierre
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

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

Han, X., Kelsen, P., Ramachandran, V., & Tarjan, R. E. (1995). Computing Minimal Spanning Subgraphs in Linear Time. SIAM Journal on Computing, 24(6), 1332-1358. doi:10.1137/S0097539791224509.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AC72-1

Abstract

There is no abstract available