Partitioning planar graphs with vertex costs: Algorithms and applications (Q1578391): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:57, 5 March 2024
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
