暂无分享,去创建一个
[1] Peter L. Hammer,et al. The splittance of a graph , 1981, Comb..
[2] Christian Komusiewicz,et al. Cluster editing with locally bounded modifications , 2012, Discret. Appl. Math..
[3] Russell Merris,et al. Split graphs , 2003, Eur. J. Comb..
[4] Amedeo Napoli,et al. A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to {k}-sparse graphs , 2015, Inf. Process. Lett..
[5] Pierre Hansen,et al. Cluster analysis and mathematical programming , 1997, Math. Program..
[6] Jan Arne Telle,et al. Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems , 2013, Theor. Comput. Sci..
[7] John A. Hartigan,et al. Clustering Algorithms , 1975 .
[8] Pinar Heggernes,et al. Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs , 2010, WG.
[9] Venkatesan Guruswami,et al. Clustering with qualitative information , 2005, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[10] A. Napoli,et al. A one-toone correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem , and its application to P 4-sparse graphs , 2019 .
[11] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .
[12] Yong Gao,et al. The cluster deletion problem for cographs , 2013, Discret. Math..
[13] Andrzej Lingas,et al. On the Approximability of Maximum and Minimum Edge Clique Partition Problems , 2006, CATS.
[14] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.
[15] Michael U. Gerber,et al. Algorithms for vertex-partitioning problems on graphs with fixed clique-width , 2003, Theor. Comput. Sci..
[16] Jan Arne Telle,et al. Algorithms for Vertex Partitioning Problems on Partial k-Trees , 1997, SIAM J. Discret. Math..
[17] Udi Rotics,et al. On the Clique-Width of Some Perfect Graph Classes , 2000, Int. J. Found. Comput. Sci..
[18] Flavia Bonomo,et al. Complexity of the cluster deletion problem on subclasses of chordal graphs , 2015, Theor. Comput. Sci..
[19] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..
[20] Roded Sharan,et al. Cluster Graph Modification Problems , 2002, WG.
[21] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[22] Christian Komusiewicz,et al. On the Relation of Strong Triadic Closure and Cluster Deletion , 2018, Algorithmica.
[23] Petr A. Golovach,et al. Parameterized Aspects of Strong Subgraph Closure , 2018, Algorithmica.
[24] Erik Jan van Leeuwen,et al. Solving Partition Problems Almost Always Requires Pushing Many Vertices Around , 2018, ESA.
[25] Avrim Blum,et al. Correlation Clustering , 2004, Machine Learning.
[26] Charu C. Aggarwal,et al. Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.