Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
scientific article

    Statements

    Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (English)
    0 references
    0 references
    0 references
    7 September 2017
    0 references
    polynomial-time algorithm
    0 references
    longest path problem
    0 references
    interval graphs
    0 references
    proper interval vertex deletion set
    0 references
    data reduction
    0 references
    fixed-parameter algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references