Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
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: Even faster parameterized cluster deletion and 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: On the approximation of correlation clustering and consensus clustering / 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: 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: 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: 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: Q3002775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437501 / 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: Optimal Edge Deletions for Signed Graph Balancing / 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: A general method to speed up fixed-parameter-tractable algorithms / 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

Revision as of 16:48, 10 July 2024

scientific article
Language Label Description Also known as
English
Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
scientific article

    Statements

    Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (English)
    0 references
    0 references
    0 references
    0 references
    2 September 2015
    0 references
    parameterized algorithm
    0 references
    kernelization
    0 references
    cluster graph
    0 references
    clustering
    0 references
    graph modification
    0 references

    Identifiers