Fully dynamic approximate maximum matching and minimum vertex cover in \(O(\log^3 n)\) worst case update time (Q4575767)
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 6904058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fully dynamic approximate maximum matching and minimum vertex cover in \(O(\log^3 n)\) worst case update time |
scientific article; zbMATH DE number 6904058 |
Statements
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time (English)
0 references
16 July 2018
0 references
0.9297187328338624
0 references
0.9266138672828674
0 references
0.926608145236969
0 references
0.9215227961540222
0 references
0.9213663935661316
0 references
