Nearly linear time minimum spanning tree maintenance for transient node failures
Open access
Date
2004-10Type
- Journal Article
ETH Bibliography
yes
Altmetrics
Permanent link
https://doi.org/10.3929/ethz-b-000049951Publication status
publishedExternal links
Journal / series
AlgorithmicaVolume
Pages / Article No.
Publisher
SpringerEvent
Subject
Graph algorithms; Minimum spanning tree; Transient node failures; Fault tolerance; Algorithmic mechanism designNotes
It was possible to publish this article open access thanks to a Swiss National Licence with the publisherMore
Show all metadata
ETH Bibliography
yes
Altmetrics