A short note on the complexity of computing strong pathbreadth (Q1705708)

From MaRDI portal
Revision as of 05:02, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A short note on the complexity of computing strong pathbreadth
scientific article

    Statements

    title
    A short note on the complexity of computing strong pathbreadth (English)
    0 references
    author
    Guillaume Ducoffe
    0 references
    publication date
    16 March 2018
    0 references
    zbMATH Keywords
    strong pathbreadth
    0 references
    path decomposition
    0 references
    acyclic clustering
    0 references
    graph theory
    0 references
    NP-completeness
    0 references
    computational complexity
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6851040
    0 references
    OpenAlex ID
    W2791129715
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1705708&oldid=38708722"
    Powered by MediaWiki