Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs (Q3082947)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5867707
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs |
scientific article; zbMATH DE number 5867707 |
Statements
Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs (English)
0 references
18 March 2011
0 references
planar graphs
0 references
minimum spanning tree
0 references
transient node failures
0 references
radio networks survivability
0 references
0.8507438
0 references
0.84846354
0 references
0.84557754
0 references
0.8442666
0 references
0.8419008
0 references
0.8413297
0 references
0.83868855
0 references
0.8379223
0 references
0.8379223
0 references
