The complexity of tree partitioning (Q5918926)

From MaRDI portal
scientific article; zbMATH DE number 6778694
Language Label Description Also known as
English
The complexity of tree partitioning
scientific article; zbMATH DE number 6778694

    Statements

    title
    The complexity of tree partitioning (English)
    0 references
    zbMATH Open document ID
    1453.68120
    0 references
    1453.68119
    0 references
    author
    Zhao An
    0 references
    Qilong Feng
    0 references
    Iyad A. Kanj
    0 references
    Ge Xia
    0 references
    publication date
    3 September 2020
    0 references
    22 September 2017
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C05
    0 references
    05C70
    0 references
    05C85
    0 references
    68Q27
    0 references
    68W40
    0 references
    zbMATH DE Number
    7243308
    0 references
    6778694
    0 references
    zbMATH Keywords
    tree partitioning
    0 references
    parameterized complexity
    0 references
    subexponential-time algorithms
    0 references
    OpenAlex ID
    W3014027871
    0 references
    W2963001873
    0 references
    arXiv ID
    1704.05896
    0 references
    cites work
    Q3651735
    0 references
    Q4198056
    0 references
    Q4888644
    0 references
    Q5710169
    0 references
    Q3549709
    0 references
    Q4601910
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5918926&oldid=36614040"
    Powered by MediaWiki