Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time (Q764322)
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: Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time |
scientific article; zbMATH DE number 6014312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time |
scientific article; zbMATH DE number 6014312 |
Statements
Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time (English)
0 references
13 March 2012
0 references
counting and sampling
0 references
minimum \((s,t)\)-cuts
0 references
weighted planar graphs
0 references
maximum flow
0 references
maximal antichains in partially ordered sets
0 references
0 references
0 references
0.9848023056983948
0 references
0.8656904697418213
0 references
0.8441022634506226
0 references
0.8327050805091858
0 references
