A faster FPT algorithm for 3-path vertex cover (Q903365): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimum \(k\)-path vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the minimum 3-path vertex cover and dissociation number of graphs / 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: The complexity of dissociation set problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter algorithm for the vertex cover \(P_3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex cover \(P_3\) problem in cubic graphs / 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 / cites work
 
Property / cites work: A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of restricted spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing Color Coding-Related Techniques / rank
 
Normal rank

Latest revision as of 06:37, 11 July 2024

scientific article
Language Label Description Also known as
English
A faster FPT algorithm for 3-path vertex cover
scientific article

    Statements

    A faster FPT algorithm for 3-path vertex cover (English)
    0 references
    0 references
    5 January 2016
    0 references
    fixed-parameter algorithm
    0 references
    path vertex cover
    0 references
    dissociation number
    0 references
    branch and reduce
    0 references
    analysis of algorithms
    0 references
    computational complexity
    0 references
    graph algorithms
    0 references

    Identifiers