Towards a polynomial kernel for directed feedback vertex set (Q2663705): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-020-00777-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2775670884 / rank
 
Normal rank
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: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference / 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: Q5111250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cubic kernel for feedback vertex set and loop cutset / 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: Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation / 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: A fixed-parameter algorithm for the directed feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of losing width / 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: Q4947393 / 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: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Circuits Contained in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback sets and multicuts in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization using structural parameters on sparse graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of H-Transversal/Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles through prescribed vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed cycles through a specified vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster deterministic \textsc{Feedback Vertex Set} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles intersecting a set of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster fixed parameter tractable algorithms for finding feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits fractionally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing circuits in eulerian digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 4 <i>k</i> <sup>2</sup> kernel for feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Half-integrality, LP-branching and FPT Algorithms / rank
 
Normal rank

Latest revision as of 01:07, 25 July 2024

scientific article
Language Label Description Also known as
English
Towards a polynomial kernel for directed feedback vertex set
scientific article

    Statements

    Towards a polynomial kernel for directed feedback vertex set (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 April 2021
    0 references
    0 references
    parameterized algorithms
    0 references
    kernelization
    0 references
    (Directed) feedback vertex set
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references