Finding Hamiltonian Cycle in Graphs of Bounded Treewidth (Q4984872)

From MaRDI portal
Revision as of 21:37, 1 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126530690, #quickstatements; #temporary_batch_1722544330843)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7335956
Language Label Description Also known as
English
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth
scientific article; zbMATH DE number 7335956

    Statements

    title
    Finding Hamiltonian Cycle in Graphs of Bounded Treewidth (English)
    0 references
    author
    Michal Ziobro
    0 references
    Marcin Pilipczuk
    0 references
    publication date
    21 April 2021
    0 references
    zbMATH Keywords
    bounded treewidth
    0 references
    Hamiltonian cycle
    0 references
    experimental evaluation
    0 references
    cites work
    Q5111890
    0 references
    Q4269437
    0 references

    Identifiers

    DOI
    10.1145/3368631
    0 references
    zbMATH DE Number
    7335956
    0 references
    OpenAlex ID
    W2996558957
    0 references
    Wikidata QID
    Q126530690
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4984872&oldid=37543786"
    Powered by MediaWiki