Typical sequences revisited -- computing width parameters of graphs (Q2701067)

From MaRDI portal
Revision as of 11:49, 7 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Typical sequences revisited -- computing width parameters of graphs
scientific article

    Statements

    Typical sequences revisited -- computing width parameters of graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2023
    0 references
    typical sequences
    0 references
    treewidth
    0 references
    series parallel digraphs
    0 references
    cutwidth
    0 references
    modified cutwidth
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references