Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees (Q4337633)
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: Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees |
scientific article; zbMATH DE number 1012872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees |
scientific article; zbMATH DE number 1012872 |
Statements
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees (English)
0 references
26 May 1997
0 references
analysis of algorithms
0 references
data structures
0 references
embedded planar graph
0 references
fully persistent data structures
0 references
k smallest spanning trees
0 references
minimum spanning tree
0 references
on-line updating
0 references
topology tree
0 references
2-edge-connectivity
0 references
0.8063332438468933
0 references
0.8027608394622803
0 references
0.7991812825202942
0 references
