Partitioning planar graphs with vertex costs: Algorithms and applications (Q1578391): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:50, 1 February 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
