Structural parameterization of cluster deletion (Q6070784): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Going weighted: parameterized algorithms for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph motif problem parameterized by the structure of the input graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the cluster deletion problem on subclasses of chordal graphs / 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: Polynomial kernels for paw-free edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cluster deletion problem for cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relation of strong triadic closure and cluster deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternative Parameterizations for Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the strong triadic closure in split graphs and proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster deletion on interval graphs and split related graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic meta-theorems for restrictions of treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motif and Hypergraph Correlation Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster deletion revisited / rank
 
Normal rank

Latest revision as of 14:25, 19 August 2024

scientific article; zbMATH DE number 7770306
Language Label Description Also known as
English
Structural parameterization of cluster deletion
scientific article; zbMATH DE number 7770306

    Statements

    Structural parameterization of cluster deletion (English)
    0 references
    24 November 2023
    0 references
    cluster deletion problem
    0 references
    twin cover
    0 references
    neighborhood diversity
    0 references
    0 references
    0 references
    0 references

    Identifiers