Breaking quadratic time for small vertex connectivity and an approximation scheme (Q5212766): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2964010100 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1904.04453 / rank | |||
Normal rank | |||
Latest revision as of 23:52, 19 April 2024
scientific article; zbMATH DE number 7160505
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Breaking quadratic time for small vertex connectivity and an approximation scheme |
scientific article; zbMATH DE number 7160505 |
Statements
Breaking quadratic time for small vertex connectivity and an approximation scheme (English)
0 references
30 January 2020
0 references
graph algorithms
0 references
local flow algorithms
0 references
vertex connectivity
0 references
