Parameterized complexity of Eulerian deletion problems (Q2441593)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Parameterized complexity of Eulerian deletion problems
scientific article

    Statements

    Parameterized complexity of Eulerian deletion problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 March 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    fixed-parameter tractability
    0 references
    kernelization
    0 references
    Eulerian graph
    0 references
    deletion distance
    0 references
    0 references
    0 references