暂无分享,去创建一个
[1] Petr A. Golovach,et al. Parameterized Aspects of Strong Subgraph Closure , 2018, Algorithmica.
[2] Mark S. Granovetter. The Strength of Weak Ties , 1973, American Journal of Sociology.
[3] Jayme Luiz Szwarcfiter,et al. Applying Modular Decomposition to Parameterized Cluster Editing Problems , 2008, Theory of Computing Systems.
[4] Yong Gao,et al. The cluster deletion problem for cographs , 2013, Discret. Math..
[5] Charis Papadopoulos,et al. Strong triadic closure in cographs and graphs of low maximum degree , 2018, Theor. Comput. Sci..
[6] Van Bang Le. Gallai graphs and anti-Gallai graphs , 1996, Discret. Math..
[7] Jiong Guo. A more effective linear kernelization for cluster editing , 2009, Theor. Comput. Sci..
[8] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[9] Ian Holyer,et al. The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..
[10] Christian Komusiewicz,et al. Cluster editing with locally bounded modifications , 2012, Discret. Appl. Math..
[11] Anders Yeo,et al. Kernel bounds for disjoint cycles and disjoint paths , 2009, Theor. Comput. Sci..
[12] Michal Pilipczuk,et al. Parameterized Algorithms , 2015, Springer International Publishing.
[13] Panayiotis Tsaparas,et al. Using strong triadic closure to characterize ties in social networks , 2014, KDD.
[14] Stefan Kratsch,et al. Kernelization Lower Bounds by Cross-Composition , 2012, SIAM J. Discret. Math..
[15] Roded Sharan,et al. Cluster graph modification problems , 2002, Discret. Appl. Math..
[16] Wen-Lian Hsu,et al. Substitution Decomposition on Chordal Graphs and Applications , 1991, ISA.
[17] Michael R. Fellows,et al. Fundamentals of Parameterized Complexity , 2013 .
[18] Najiba Sbihi,et al. Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..
[19] Peter Damaschke,et al. Even faster parameterized cluster deletion and cluster editing , 2011, Inf. Process. Lett..
[20] Charis Papadopoulos,et al. Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs , 2016, ISAAC.
[21] Stephan Olariu,et al. Paw-Fee Graphs , 1988, Inf. Process. Lett..
[22] Shimon Even,et al. An O (N2.5) algorithm for maximum matching in general graphs , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[23] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[24] S. Poljak. A note on stable sets and colorings of graphs , 1974 .
[25] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[26] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[27] Liping Sun. Two classes of perfect graphs , 1991, J. Comb. Theory, Ser. B.