Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A tight approximation algorithm for the cluster vertex deletion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast branching algorithm for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex deletion problems on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and complexity of \(s\)-club cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time Algorithm for Maximum Weight Independent Set on <i>P</i> <sub>6</sub> -free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected vertex cover for \((sP_1+P_5)\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsc{max-cut} and containment relations in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Running Time Lower Bounds for Vertex Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of domination number determination in monogenic classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary classes for graph problems involving non-local properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing independent sets in graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting forbidden induced subgraphs on bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parameterized algorithm for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank

Revision as of 12:06, 3 December 2024

scientific article; zbMATH DE number 7835107
Language Label Description Also known as
English
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
scientific article; zbMATH DE number 7835107

    Statements

    Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (English)
    0 references
    0 references
    0 references
    21 April 2024
    0 references
    0 references
    0 references
    0 references

    Identifiers

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