Nearly linear time minimum spanning tree maintenance for transient node failures
![Thumbnail](/bitstream/handle/20.500.11850/49951/453_2004_Article_1099.pdf.jpg?sequence=4&isAllowed=y)
Open access
Datum
2004-10Typ
- Journal Article
ETH Bibliographie
yes
Altmetrics
Persistenter Link
https://doi.org/10.3929/ethz-b-000049951Publikationsstatus
publishedExterne Links
Zeitschrift / Serie
AlgorithmicaBand
Seiten / Artikelnummer
Verlag
SpringerKonferenz
Thema
Graph algorithms; Minimum spanning tree; Transient node failures; Fault tolerance; Algorithmic mechanism designAnmerkungen
It was possible to publish this article open access thanks to a Swiss National Licence with the publisherETH Bibliographie
yes
Altmetrics