Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees (Q4337633): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56077950, #quickstatements; #temporary_batch_1712260040974 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539792226825 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2104224360 / rank | |||
Normal rank | |||
Latest revision as of 08:52, 30 July 2024
scientific article; zbMATH DE number 1012872
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
