Cluster editing problem for points on the real line: a polynomial time algorithm (Q1675767): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Cluster graph modification problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Aggregating inconsistent information / 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: Q4437501 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3579409 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation algorithms for geometric median problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3093206 / rank | |||
Normal rank |
Latest revision as of 16:39, 14 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cluster editing problem for points on the real line: a polynomial time algorithm |
scientific article |
Statements
Cluster editing problem for points on the real line: a polynomial time algorithm (English)
0 references
3 November 2017
0 references
graph algorithms
0 references
clustering
0 references
dynamic programming
0 references
0 references