Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60488409, #quickstatements; #temporary_batch_1711094041063
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Aggregating inconsistent information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast FAST / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic forms on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A golden ratio parameterized algorithm for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Editing / 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: Exact algorithms for cluster editing: Evaluation and experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even faster parameterized cluster deletion and cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with partial information / 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: Cluster editing: kernelization based on edge cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with qualitative information / 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: Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-based data clustering with overlaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for parameterized complexity of Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365078 / 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: Correlation clustering with a fixed number of clusters / 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: Editing graphs into disjoint unions of dense clusters / 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: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What’s Next? Future Directions in Parameterized Complexity / 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: Cluster graph modification problems / rank
 
Normal rank

Latest revision as of 14:09, 8 July 2024

scientific article
Language Label Description Also known as
English
Tight bounds for parameterized complexity of cluster editing with a small number of clusters
scientific article

    Statements

    Tight bounds for parameterized complexity of cluster editing with a small number of clusters (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 June 2014
    0 references
    cluster editing
    0 references
    correlation clustering
    0 references
    parameterized complexity
    0 references
    subexponential-time algorithms
    0 references
    exponential-time hypothesis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers