Efficient algorithms for \(k\)-terminal cuts on planar graphs (Q4474100)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2081002
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for \(k\)-terminal cuts on planar graphs |
scientific article; zbMATH DE number 2081002 |
Statements
4 August 2004
0 references
0.9943585991859436
0 references
0.8842823505401611
0 references
0.884211540222168
0 references
0.8581910729408264
0 references
0.8551498055458069
0 references
Efficient algorithms for \(k\)-terminal cuts on planar graphs (English)
0 references
