Finding small-width connected path decompositions in polynomial time (Q2328867)

From MaRDI portal
Revision as of 17:13, 20 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding small-width connected path decompositions in polynomial time
scientific article

    Statements

    Finding small-width connected path decompositions in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    16 October 2019
    0 references
    connected graph searching
    0 references
    connected pathwidth
    0 references
    graph searching
    0 references
    pathwidth
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references