Partitioning planar graphs with vertex costs: Algorithms and applications (Q1578391)
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: Partitioning planar graphs with vertex costs: Algorithms and applications |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning planar graphs with vertex costs: Algorithms and applications |
scientific article |
Statements
Partitioning planar graphs with vertex costs: Algorithms and applications (English)
0 references
27 August 2000
0 references
graph embedding problems
0 references
graph pebbling
0 references
multicommodity flow problems
0 references
