A faster algorithm for the cluster editing problem on proper interval graphs
O(n+m) O ( n + m ) time algorithm to solve cluster editing problem for proper interval graphs. A variation of Mannaa's dynamic programming algorithm with O(n) O ( n ) space. Using straight representation for proper interval graphs.
cluster editing problem graph algorithms proper interval models linear space algorithm