Deterministic fully dynamic data structures for vertex cover and matching (Q4571920)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deterministic fully dynamic data structures for vertex cover and matching |
scientific article; zbMATH DE number 6898311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministic fully dynamic data structures for vertex cover and matching |
scientific article; zbMATH DE number 6898311 |
Statements
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (English)
0 references
4 July 2018
0 references
fully dynamic algorithms
0 references
minimum vertex conver
0 references
maximum matching
0 references
dynamic data structures
0 references
primal-dual method
0 references
0 references
0 references
0.998689353466034
0 references
0.9277395009994508
0 references
0.922135591506958
0 references
0.9215227961540222
0 references
0.9108981490135192
0 references
