Nearly linear time minimum spanning tree maintenance for transient node failures (Q1882530)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nearly linear time minimum spanning tree maintenance for transient node failures |
scientific article; zbMATH DE number 2104935
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearly linear time minimum spanning tree maintenance for transient node failures |
scientific article; zbMATH DE number 2104935 |
Statements
Nearly linear time minimum spanning tree maintenance for transient node failures (English)
0 references
1 October 2004
0 references
Graph algorithms
0 references
Minimum spanning tree
0 references
Transient node failures
0 references
Fault tolerance
0 references
Algorithmic mechanism design
0 references
