Parameterized algorithms for min-max 2-cluster editing (Q2410027): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Aggregating inconsistent information / 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 golden ratio parameterized algorithm for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized PTAS for the minimum consensus clustering with a fixed number of clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximation of correlation clustering and consensus clustering / 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: Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms / 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: Sufficient conditions for edit-optimal clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing Simple Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-based data clustering with overlaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Integration in the Life Sciences / 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: Q3002775 / 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: Automated generation of search tree algorithms for hard graphs modification problems / 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: On the notion of balance of a signed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Clique Editing Problem / rank
 
Normal rank
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: Q4397004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions / rank
 
Normal rank

Latest revision as of 14:19, 14 July 2024

scientific article
Language Label Description Also known as
English
Parameterized algorithms for min-max 2-cluster editing
scientific article

    Statements

    Parameterized algorithms for min-max 2-cluster editing (English)
    0 references
    0 references
    0 references
    17 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized algorithm
    0 references
    parameterized complexity
    0 references
    graph modification
    0 references
    clustering
    0 references
    randomized algorithm
    0 references
    subexponential algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references