Computing Pathwidth Faster Than 2 n (Q3656873)

From MaRDI portal
Revision as of 14:18, 17 October 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
Computing Pathwidth Faster Than 2 n
scientific article

    Statements

    title
    Computing Pathwidth Faster Than 2 n (English)
    0 references
    author
    Karol Suchan
    0 references
    Yngve Villanger
    0 references
    publication date
    14 January 2010
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C85
    0 references
    68Q25
    0 references
    68W25
    0 references
    zbMATH DE Number
    5658382
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3656873&oldid=8085776"
      Powered by MediaWiki