Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (Q5441357): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/502090.502095 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2045430818 / rank | |||
Normal rank |
Latest revision as of 00:10, 20 March 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