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

From MaRDI portal
Revision as of 03:57, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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