A randomized polynomial kernel for subset feedback vertex set (Q1702849): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1512.02510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel / 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: Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Menger's graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen / 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: Faster deterministic \textsc{Feedback Vertex Set} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representative Sets and Irrelevant Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Parameterized Algorithms for Subset Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid matching and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized view on matroid optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small separators in linear time via treewidth reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Mader's \(\mathcal S\)-paths theorem / 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: Q3680844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Half-integrality, LP-branching and FPT Algorithms / rank
 
Normal rank

Latest revision as of 05:48, 15 July 2024

scientific article
Language Label Description Also known as
English
A randomized polynomial kernel for subset feedback vertex set
scientific article

    Statements

    A randomized polynomial kernel for subset feedback vertex set (English)
    0 references
    0 references
    0 references
    1 March 2018
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    subset feedback vertex set
    0 references
    0 references
    0 references

    Identifiers

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