A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Kernelization Algorithms for d-Hitting Set Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounded-degree vertex deletion parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / 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 generalization of Nemhauser and Trotter's local optimization theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for Packing and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation concepts for efficiently enumerating dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general method to speed up fixed-parameter-tractable algorithms / 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: A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the vertex cover \(P^3\) problem / rank
 
Normal rank

Latest revision as of 23:18, 10 July 2024

scientific article
Language Label Description Also known as
English
A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion
scientific article

    Statements

    A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (English)
    0 references
    0 references
    29 October 2015
    0 references
    parameterized algorithm
    0 references
    measure and conquer
    0 references
    branch and reduce
    0 references
    bounded degree-one deletion
    0 references
    vertex cover \(P_3\)
    0 references

    Identifiers

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