Computing Pathwidth Faster Than 2 n (Q3656873)

From MaRDI portal
Revision as of 06:44, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)





scientific article
Language Label Description Also known as
English
Computing Pathwidth Faster Than 2 n
scientific article

    Statements

    Computing Pathwidth Faster Than 2 n (English)
    0 references
    0 references
    0 references
    14 January 2010
    0 references

    Identifiers

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