Name
Abstract | ||
|---|---|---|
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 ) space.Using straight representation for proper interval graphs. 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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ipl.2015.07.009 | Information Processing Letters |
Keywords | Field | DocType |
Graph algorithms,Cluster editing problem,Proper interval models,Linear space algorithm | Graph algorithms,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Interval graph,Algorithm,Graph bandwidth,Mathematics | Journal |
Volume | Issue | ISSN |
115 | 12 | 0020-0190 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Min Chih Lin | 1 | 259 | 21.22 |
| Francisco J. Soulignac | 2 | 101 | 10.56 |
| Jayme Luiz Szwarcfiter | 3 | 618 | 95.79 |