Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time (Q3586078)
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 Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time |
scientific article |
Statements
Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time (English)
0 references
3 September 2010
0 references
