Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224)

From MaRDI portal
Revision as of 23:19, 3 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximating the Maximally Balanced Connected Partition Problem in graphs
scientific article

    Statements

    Approximating the Maximally Balanced Connected Partition Problem in graphs (English)
    0 references
    0 references
    28 February 1997
    0 references
    0 references
    Analysis of algorithms
    0 references
    Combinatorial problems
    0 references
    Connected graphs
    0 references