Efficient algorithms for \(k\)-terminal cuts on planar graphs (Q1889599)
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: Efficient algorithms for \(k\)-terminal cuts on planar graphs |
scientific article; zbMATH DE number 2121092
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for \(k\)-terminal cuts on planar graphs |
scientific article; zbMATH DE number 2121092 |
Statements
Efficient algorithms for \(k\)-terminal cuts on planar graphs (English)
0 references
2 December 2004
0 references
0.92367625
0 references
0.9182501
0 references
0.91577995
0 references
0.9122106
0 references
0.90843123
0 references
0.9017271
0 references
0 references
