Min \(st\)-cut oracle for planar graphs with near-linear preprocessing time (Q4962174)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Min st-cut oracle for planar graphs with near-linear preprocessing time |
scientific article; zbMATH DE number 6968305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Min \(st\)-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
0.8475325703620911
0 references
0.8474950790405273
0 references
0.8389628529548645
0 references
0.8382361531257629
0 references
