Improved algorithms for min cut and max flow in undirected planar graphs (Q5419101): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1993636.1993679 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2103099082 / rank | |||
Normal rank | |||
Revision as of 23:22, 19 March 2024
scientific article; zbMATH DE number 6301155
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved algorithms for min cut and max flow in undirected planar graphs |
scientific article; zbMATH DE number 6301155 |
Statements
Improved algorithms for min cut and max flow in undirected planar graphs (English)
0 references
5 June 2014
0 references
dynamic algorithm
0 references
\textsc{Max-flow}
0 references
\textsc{Min-cut}
0 references
planar graph
0 references
