Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (Q5441357): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q55951524, #quickstatements; #temporary_batch_1707149277123 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55951524 / rank | |||
Normal rank | |||
Revision as of 19:53, 5 February 2024
scientific article; zbMATH DE number 5234643
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity |
scientific article; zbMATH DE number 5234643 |
Statements
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (English)
0 references
11 February 2008
0 references
