Improved algorithms for min cut and max flow in undirected planar graphs (Q5419101): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): conf/stoc/ItalianoNSW11, #quickstatements; #temporary_batch_1731505720702 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: conf/stoc/ItalianoNSW11 / rank | |||
Normal rank | |||
Latest revision as of 15:35, 13 November 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
