Min <i>st</i> -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time (Q4962174)
From MaRDI portal
scientific article; zbMATH DE number 6968305
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Min <i>st</i> -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time |
scientific article; zbMATH DE number 6968305 |
Statements
Min <i>st</i> -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time (English)
0 references
30 October 2018
0 references
minimum cut
0 references
minimum cycle basis
0 references
planar graphs
0 references
