Partitioning planar graphs with vertex costs: Algorithms and applications (Q1578391)

From MaRDI portal
Revision as of 21:50, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    27 August 2000
    0 references
    graph embedding problems
    0 references
    graph pebbling
    0 references
    multicommodity flow problems
    0 references
    0 references

    Identifiers