On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter (Q4598187)
From MaRDI portal
scientific article; zbMATH DE number 6820237
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter |
scientific article; zbMATH DE number 6820237 |
Statements
19 December 2017
0 references
conditional lower bounds
0 references
maximum cardinality matching
0 references
diameter in graphs
0 references
hardness in P
0 references
partially dynamic problems
0 references
maximum flow
0 references
On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter (English)
0 references
