Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time (Q3586078): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_13 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1481341021 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:26, 19 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
