Parameterized dynamic cluster editing (Q2223691): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the complexity of multi-parameterized cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of dynamic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with vertex splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Reoptimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Editing / 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: Incremental Clustering and Dynamic Information Retrieval / 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: Cluster Editing in Multi-Layer and Temporal Graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering With Multi-Layer Graphs: A Spectral Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5074183 / 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: Local search: is brute-force avoidable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for parameterized complexity of cluster editing with a small number of clusters / 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: A more effective linear kernelization for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of local search for TSP, more refined / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental list coloring of graphs, parameterized by conservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic parameterized problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Dynamic Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity and local search approaches for the stable marriage problem with ties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local equivalences of distances between clusterings -- a geometric perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory and algorithms for combinatorial reoptimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank

Latest revision as of 11:07, 24 July 2024

scientific article
Language Label Description Also known as
English
Parameterized dynamic cluster editing
scientific article

    Statements

    Parameterized dynamic cluster editing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 February 2021
    0 references
    graph-based data clustering
    0 references
    incremental clustering
    0 references
    compromise clustering
    0 references
    correlation clustering
    0 references
    local search
    0 references
    goal-oriented clustering
    0 references
    \textsf{NP}-hard problems
    0 references
    fixed-parameter tractability
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    multi-choice knapsack
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers