On the Parameterized Complexity of Computing Graph Bisections (Q2864292)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the Parameterized Complexity of Computing Graph Bisections
scientific article

    Statements

    On the Parameterized Complexity of Computing Graph Bisections (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 December 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references