On the kernelization of split graph problems (Q2636501): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2759324182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crown structures for vertex cover kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for disjoint cycles and disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / 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: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting Forbidden Minors: Approximation and Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parameterized algorithms for deletion to split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining split graphs by edge contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth of Split Graphs and Threshold Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding disjoint paths in split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing kernelization for finding long paths and cycles in restricted graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global wire routing in two-dimensional arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: The efficiency and stability of R\&D networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nestedness in networks: A theoretical model and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of <i>k</i>-B<scp>iclique</scp> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above or below guaranteed values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5363786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / 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: Planar graph vertex partition for linear problem kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and kernels for bipartition into degree-bounded induced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards optimal kernel for edge-disjoint triangle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization of Two Path Searching Problems on Split Graphs / rank
 
Normal rank

Latest revision as of 19:23, 15 July 2024

scientific article
Language Label Description Also known as
English
On the kernelization of split graph problems
scientific article

    Statements

    On the kernelization of split graph problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 June 2018
    0 references
    split graph
    0 references
    kernelization
    0 references
    parameterized complexity
    0 references
    \(k\)-path
    0 references
    \(k\)-cycle
    0 references
    crown decomposition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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