The complexity of counting Eulerian tours in 4-regular graphs (Q2429360)

From MaRDI portal
Revision as of 08:09, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The complexity of counting Eulerian tours in 4-regular graphs
scientific article

    Statements

    title
    The complexity of counting Eulerian tours in 4-regular graphs (English)
    0 references
    author
    Qi Ge
    0 references
    Daniel Štefanković
    0 references
    published in
    Algorithmica
    0 references
    publication date
    26 April 2012
    0 references
    zbMATH DE Number
    6028489
    0 references
    zbMATH Keywords
    Eulerian tours
    0 references
    A-trails
    0 references
    \#P-complete
    0 references
    AP-reduction
    0 references
    fully polynomial randomized approximation scheme
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2429360&oldid=26958416"
    Powered by MediaWiki