The multi-parameterized cluster editing problem
The Cluster Editing problem seeks a transformation of a given undirected graph into a transitive graph via a minimum number of edge-edit operations. Existing algorithms often exhibit slow performance and could deliver clusters of no practical significance, such as singletons. A constrained version o...
Saved in:
| Main Author: | |
|---|---|
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5378 http://dx.doi.org/10.1007/978-3-319-03780-6_25 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://link.springer.com/chapter/10.1007/978-3-319-03780-6_25 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|