On the complexity of multi-parameterized cluster editing
The Cluster Editing problem seeks a transformation of a given undirected graph into a disjoint union of cliques via a minimum number of edge additions or deletions. A multi-parameterized version of the problem is studied, featuring a number of constraints that bound the amounts of both edge-addition...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | article |
| منشور في: |
2017
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/7486 https://doi.org/10.1016/j.jda.2017.07.003 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://www.sciencedirect.com/science/article/pii/S1570866717300473 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|