Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time (Q3586078): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710339121855 |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 16:37, 13 March 2024
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
