Incremental exact min-cut in polylogarithmic amortized update time (Q4554344)
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 6979207
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Incremental exact min-cut in polylogarithmic amortized update time |
scientific article; zbMATH DE number 6979207 |
Statements
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time (English)
0 references
13 November 2018
0 references
minimum cut
0 references
edge connectivity
0 references
space-efficient dynamic graph algorithms
0 references
0.8743931651115417
0 references
0.8406157493591309
0 references
0.8273174166679382
0 references
0.8079547882080078
0 references
