Edge deletion problems: branching facilitated by modular decomposition (Q2257301): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1599636
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jian'er Chen / 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.tcs.2015.01.049 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994844060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Polynomial Kernelization of $$\mathcal {H}$$-free Edge Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernels for proper interval completion and related problems / 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: Cluster editing: kernelization based on edge cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal Editing 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: Q2965491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial kernel for trivially perfect editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Parameterized Algorithm for Minimum Fill-In / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivially perfect 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: Q5503435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / 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: Complexity and parameterized algorithms for cograph editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Novel Branching Strategy for Parameterized Graph Modification Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum: 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: Quasi-threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank

Latest revision as of 18:22, 9 July 2024

scientific article
Language Label Description Also known as
English
Edge deletion problems: branching facilitated by modular decomposition
scientific article

    Statements

    Edge deletion problems: branching facilitated by modular decomposition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 February 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph modification problems
    0 references
    edge deletion problems
    0 references
    chain graphs
    0 references
    trivially perfect graphs
    0 references
    modular decomposition
    0 references
    branching
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references