A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem (Q5100142)

From MaRDI portal
Revision as of 15:55, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7577101
Language Label Description Also known as
English
A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem
scientific article; zbMATH DE number 7577101

    Statements

    A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem (English)
    0 references
    29 August 2022
    0 references
    path decomposition
    0 references
    spanning tree
    0 references
    \(k\)-LST problem
    0 references
    win-win algorithm
    0 references
    FPT
    0 references

    Identifiers