On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter (Q4598187): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963365235 / rank | |||
Normal rank | |||
| Property / title | |||
On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter (English) | |||
| Property / title: On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter (English) / rank | |||
Normal rank | |||
Latest revision as of 11:02, 30 July 2024
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
