An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (Q5918121)

From MaRDI portal
scientific article; zbMATH DE number 6778701
Language Label Description Also known as
English
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width
scientific article; zbMATH DE number 6778701

    Statements

    title
    An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (English)
    0 references
    author
    Benjamin Bergougnoux
    0 references
    O-joung Kwon
    0 references
    publication date
    14 April 2020
    0 references
    22 September 2017
    0 references
    zbMATH Keywords
    Hamiltonian cycle
    0 references
    Eulerian trail
    0 references
    clique-width
    0 references
    XP-algorithm
    0 references
    edge dominating sets
    0 references
    exponential time hypothesis
    0 references
    cites work
    Q5075752
    0 references
    Q3077955
    0 references
    Q5315023
    0 references
    Q4448752
    0 references
    Clique-width III
    0 references
    Q3113705
    0 references
    Q5538410
    0 references

    Identifiers

    zbMATH Open document ID
    1433.68279
    0 references
    1458.05131
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C38
    0 references
    05C45
    0 references
    05C85
    0 references
    68W40
    0 references
    68Q17
    0 references
    zbMATH DE Number
    7189180
    0 references
    6778701
    0 references
    OpenAlex ID
    W2995628723
    0 references
    W2594539199
    0 references
    arXiv ID
    1702.06095
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5918121&oldid=36577020"
    Powered by MediaWiki