Counting Euler Tours in Undirected Bounded Treewidth Graphs (Q5275372)

From MaRDI portal
scientific article; zbMATH DE number 6744922
Language Label Description Also known as
English
Counting Euler Tours in Undirected Bounded Treewidth Graphs
scientific article; zbMATH DE number 6744922

    Statements

    0 references
    0 references
    0 references
    13 July 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Euler tours
    0 references
    bounded treewidth
    0 references
    bounded clique-width
    0 references
    Hamiltonian cycles
    0 references
    parallel algorithms
    0 references
    0 references
    0 references
    Counting Euler Tours in Undirected Bounded Treewidth Graphs (English)
    0 references