An improved FPT algorithm for almost forest deletion problem (Q1751414): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized computational complexity of Dodgson and Young elections / 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: On feedback vertex set: new measure and new structures / 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: Approximating maximum agreement forest on multiple binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / 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: Subset Feedback Vertex Set Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover Structural Parameterization Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity in AI and nonmonotonic reasoning / 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: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster deterministic \textsc{Feedback Vertex Set} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved kernel results for some FPT problems based on simple observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition on trees with supply and demand: kernelization and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parameterized independent feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT algorithms for connected feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bivariate Complexity Analysis of Almost Forest Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Exact Algorithm for Undirected Feedback Vertex Set / rank
 
Normal rank

Revision as of 16:40, 15 July 2024

scientific article
Language Label Description Also known as
English
An improved FPT algorithm for almost forest deletion problem
scientific article

    Statements

    An improved FPT algorithm for almost forest deletion problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 May 2018
    0 references
    fixed-parameter algorithm
    0 references
    feedback vertex set
    0 references
    almost forest deletion
    0 references
    iterative compression
    0 references
    graph algorithms
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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