Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size (Q2466001)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
scientific article

    Statements

    Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2008
    0 references
    algorithm
    0 references
    lower bound
    0 references
    \((l, u)\)-partition
    0 references
    maximum partition problem
    0 references
    minimum partition problem
    0 references
    partial \(k\)-tree
    0 references
    series-parallel graph
    0 references
    upper bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references