An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3112448634 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2012.04910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster parameterized algorithm for pseudoforest deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting Diamonds and Growing Cacti / 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: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting Forbidden Minors: Approximation and Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved FPT Algorithms for Deletion to Forest-Like Structures. / 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: Improved analysis of highest-degree branching for feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick but odd growth of cacti / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Feedback Vertex Sets of Size <i>k</i> in <i>O</i>*(2.7<sup><i>k</i></sup>) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Even Cycle Transversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Algorithm for Bounded-Degree Vertex Deletion / rank
 
Normal rank

Latest revision as of 22:38, 28 July 2024

scientific article
Language Label Description Also known as
English
An improved deterministic parameterized algorithm for cactus vertex deletion
scientific article

    Statements

    An improved deterministic parameterized algorithm for cactus vertex deletion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 May 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    cactus vertex deletion
    0 references
    even cycle transversal
    0 references
    fixed-parameter tractable
    0 references
    measure and conquer analysis
    0 references
    0 references
    0 references