| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427912 | Information Processing Letters | 2010 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
