A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649)

From MaRDI portal
Revision as of 12:46, 9 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
A heuristic method for solving the problem of partitioning graphs with supply and demand
scientific article

    Statements

    A heuristic method for solving the problem of partitioning graphs with supply and demand (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2016
    0 references
    graph partitioning
    0 references
    greedy algorithm
    0 references
    demand node
    0 references
    supply node
    0 references

    Identifiers