Nearly linear time minimum spanning tree maintenance for transient node failures (Q1882530): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2123839217 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:14, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearly linear time minimum spanning tree maintenance for transient node failures |
scientific article |
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
