Polynomial kernels for proper interval completion and related problems (Q393083): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2013.08.006 / rank
Normal rank
 
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.ic.2013.08.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1489471929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernels for 3-leaf power graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2k Kernel for the Cluster Editing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple linear time recognition of unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Edge Modification Problems without Polynomial Kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal greedy algorithms for indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general method to speed up fixed-parameter-tractable algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / 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: Proper Interval Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Completion Is Fixed Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2013.08.006 / rank
 
Normal rank

Latest revision as of 16:14, 9 December 2024

scientific article
Language Label Description Also known as
English
Polynomial kernels for proper interval completion and related problems
scientific article

    Statements

    Polynomial kernels for proper interval completion and related problems (English)
    0 references
    0 references
    0 references
    16 January 2014
    0 references
    parameterized complexity
    0 references
    kernelization algorithms
    0 references
    graph modification problems
    0 references
    proper interval graphs
    0 references
    0 references
    0 references

    Identifiers