Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time (Q4575767)
From MaRDI portal
scientific article; zbMATH DE number 6904058
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) 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
