On the Parameterized Complexity of Computing Graph Bisections (Q2864292)

From MaRDI portal
Revision as of 19:32, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the Parameterized Complexity of Computing Graph Bisections
scientific article

    Statements

    title
    On the Parameterized Complexity of Computing Graph Bisections (English)
    0 references
    author
    René van Bevern
    0 references
    Andreas Emil Feldmann
    0 references
    Manuel Sorge
    0 references
    Ondřej Suchý
    0 references
    publication date
    6 December 2013
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C85
    0 references
    68Q17
    0 references
    68R10
    0 references
    zbMATH DE Number
    6236255
    0 references
    OpenAlex ID
    W119774723
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2864292&oldid=31560774"
    Powered by MediaWiki