Linear kernels for separating a graph into components of bounded size (Q2361357): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Crown structures for vertex cover kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-separator problem: polyhedra, complexity and approximation results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicut is FPT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / 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: Crown reductions for the minimum weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum bisection is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of vertex integrity and component order connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation of the Minimum Bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small balanced separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Nemhauser and Trotter's local optimization theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of finding separators with non-hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4634403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation 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: Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost 2-SAT is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / 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: Simple and improved parameterized algorithms for multiterminal cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of Nemhauser and Trotter's local optimization theorem / rank
 
Normal rank

Latest revision as of 01:06, 14 July 2024

scientific article
Language Label Description Also known as
English
Linear kernels for separating a graph into components of bounded size
scientific article

    Statements

    Linear kernels for separating a graph into components of bounded size (English)
    0 references
    0 references
    30 June 2017
    0 references
    balanced separators
    0 references
    FPT
    0 references
    graph algorithms
    0 references
    linear kernels
    0 references
    NT-theorem
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers