An FPT algorithm for the vertex cover \(P_4\) problem (Q906446): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2015.06.032 / rank
Normal rank
 
Property / author
 
Property / author: Jian-hua Tu / rank
Normal rank
 
Property / author
 
Property / author: Ze-min Jin / rank
Normal rank
 
Property / author
 
Property / author: Jian-hua Tu / rank
 
Normal rank
Property / author
 
Property / author: Ze-min Jin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.06.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W880397381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex \(k\)-path cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-path vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weighted \(k\)-path vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for feedback vertex set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-path vertex cover of some graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another disjoint compression algorithm for odd cycle transversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the vertex cover \(P^3\) problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2015.06.032 / rank
 
Normal rank

Latest revision as of 08:05, 10 December 2024

scientific article
Language Label Description Also known as
English
An FPT algorithm for the vertex cover \(P_4\) problem
scientific article

    Statements

    An FPT algorithm for the vertex cover \(P_4\) problem (English)
    0 references
    21 January 2016
    0 references
    graph algorithms
    0 references
    parameterized complexity
    0 references
    vertex cover \(P_4\) problem
    0 references
    iterative compression
    0 references
    0 references
    0 references

    Identifiers