Cluster editing problem for points on the real line: A polynomial time algorithm
Artikel i vetenskaplig tidskrift, 2010

In this paper we consider the cluster editing problem for a special type of graphs, where the vertices represent points on the real line and there is an edge between each two vertices for which the distance between their corresponding points on the line is less than a given constant. We give a polynomial time cluster editing algorithm for this class of graphs.

Algorithms

Graph algorithms

Dynamic programming

Clustering

Författare

Bassel Mannaa

Göteborgs universitet

Information Processing Letters

0020-0190 (ISSN)

Vol. 110 961-965

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1016/j.ipl.2010.08.002