Subset feedback vertex set on graphs of bounded independent set size (Q2304562): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5075752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex set on graphs of low clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong computational lower bounds via parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parameterized algorithm for the minimum node multiway cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Exact Algorithms for Some Terminal Set Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster exact algorithms for some terminal set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generalized clique covering / 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: On Multiway Cut Parameterized above Lower Bounds / 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: Fundamentals of parameterized complexity / 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: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms via Monotone Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating minimal subset feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cuts in node weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset feedback vertex sets in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized polynomial kernel for subset feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304141 / 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: Feedback vertex set on AT-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset feedback vertex set in chordal and split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank

Latest revision as of 01:46, 22 July 2024

scientific article
Language Label Description Also known as
English
Subset feedback vertex set on graphs of bounded independent set size
scientific article

    Statements

    Subset feedback vertex set on graphs of bounded independent set size (English)
    0 references
    0 references
    0 references
    12 March 2020
    0 references
    subset feedback vertex set
    0 references
    node multiway cut
    0 references
    polynomial-time algorithm
    0 references
    NP-completeness
    0 references
    W[1]-hardness
    0 references
    graphs of bounded independent set size
    0 references
    0 references
    0 references

    Identifiers

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