A MULTI-THREAD GRASP/VND FOR THE CLUSTER EDITING PROBLEM

@inproceedings{Bastos2016AMG,
  title={A MULTI-THREAD GRASP/VND FOR THE CLUSTER EDITING PROBLEM},
  author={Lucas de O. Bastos and Luiz Satoru Ochi and F{\'a}bio Protti},
  year={2016}
}
The Cluster Editing problem is defined as follows: given as input an undirected loopless graph G = (V;E), by adding edges to G and/or removing edges from G, it must be transformed into a cluster graph, that is, an union of disjoint cliques. The Cluster Editing problem was proved to be NP-complete. This problem models several practical applications in the fields of image processing, computational biology and more. This work proposes a new multi-thread GRASP/VND algorithm to solve the problem… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

Tables from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Clustering with qualitative information

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Handbook of Meta-heuristics

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Exact and heuristic algorithms for weighted cluster editing.

Cluster graph modification problems

VIEW 1 EXCERPT

The COG database: an updated version includes eukaryotes

VIEW 1 EXCERPT