Computing Pathwidth Faster Than 2 n (Q3656873)

From MaRDI portal
Revision as of 02:47, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): conf/iwpec/SuchanV09, #quickstatements; #temporary_batch_1731461124002)
(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
    Wikidata QID
    Q62046054
    0 references
    OpenAlex ID
    W2168990208
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3656873&oldid=37892324"
    Powered by MediaWiki