Parallel Algorithms for Computing Maximal Independent Sets in Trees and for 
Updating Minimum Spanning Trees

Jung, Hermann; Mehlhorn, Kurt

doi:10.1016/0020-0190(88)90084-1

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees

MPS-Authors

Jung, Hermann
Max Planck Society;

/persons/resource/persons45021

Mehlhorn, Kurt
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

Jung, H., & Mehlhorn, K. (1988). Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees. Information Processing Letters, 27(5), 227-236. doi:10.1016/0020-0190(88)90084-1.

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

Abstract

There is no abstract available