Editing graphs into disjoint unions of dense clusters (Q652530): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-011-9487-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034185455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044359 / rank
 
Normal rank
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: 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: A 2k Kernel for the Cluster Editing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cluster Editing Problem: Implementations and Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parameterized Preprocessing for Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-modeled data clustering: Exact algorithms for clique generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A more effective linear kernelization for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A More Relaxed Model for Graph-Based Data Clustering: <i>s</i>-Plex Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard problems in hierarchical-tree clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic generalization of the clique concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems / rank
 
Normal rank

Revision as of 17:33, 4 July 2024

scientific article
Language Label Description Also known as
English
Editing graphs into disjoint unions of dense clusters
scientific article

    Statements

    Editing graphs into disjoint unions of dense clusters (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 December 2011
    0 references
    cluster editing
    0 references
    parameterized complexity
    0 references
    data reduction
    0 references
    forbidden subgraph characterization
    0 references
    NP-hardness
    0 references
    clique relaxations
    0 references

    Identifiers