Graph-based data clustering with overlaps (Q456688): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / 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: Fixed-parameter enumerability of cluster editing and related problems / 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: Graph-modeled data clustering: Exact algorithms for clique generation / 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: Applying modular decomposition to parameterized cluster editing problems / 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: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard approximation problems in overlapping clustering. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / 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: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3053461 / 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: The maximum edge biclique problem is NP-complete / 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: Q3128916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing Graphs into Disjoint Unions of Dense Clusters / rank
 
Normal rank

Latest revision as of 19:13, 5 July 2024

scientific article
Language Label Description Also known as
English
Graph-based data clustering with overlaps
scientific article

    Statements

    Graph-based data clustering with overlaps (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 October 2012
    0 references
    cluster graph modification problems
    0 references
    forbidden subgraph characterization
    0 references
    NP-hardness
    0 references
    fixed-parameter tractability
    0 references
    \(W[1]\)-hardness
    0 references
    kernelization
    0 references

    Identifiers