Improved algorithms for min cut and max flow in undirected planar graphs (Q5419101): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q61609454, #quickstatements; #temporary_batch_1706364719135 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:26, 9 February 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
