Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481)
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: Optimal lower bounds for matching and vertex cover in dynamic graph streams |
scientific article; zbMATH DE number 7561758
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal lower bounds for matching and vertex cover in dynamic graph streams |
scientific article; zbMATH DE number 7561758 |
Statements
21 July 2022
0 references
maximum matching
0 references
minimum vertex cover
0 references
dynamic graph streams
0 references
communication complexity
0 references
lower bounds
0 references
0 references
0 references
Optimal lower bounds for matching and vertex cover in dynamic graph streams (English)
0 references
