info:eu-repo/semantics/article
A faster algorithm for the cluster editing problem on proper interval graphs
Fecha
2015-12Registro en:
Lin, Min Chih; Soulignac, Francisco Juan; Szwarcfiter, Jayme L.; A faster algorithm for the cluster editing problem on proper interval graphs; Elsevier Science; Information Processing Letters; 115; 12; 12-2015; 913-916
0020-0190
CONICET Digital
CONICET
Autor
Lin, Min Chih
Soulignac, Francisco Juan
Szwarcfiter, Jayme L.
Resumen
We develop a linear-space O(n+m) time algorithm to solve the cluster editing problem for proper interval models, where n and m are the number of vertices and edges of the represented graph.