The maximum happy induced subgraph problem: Bounds and algorithms
暂无分享,去创建一个
[1] Mihalis Yannakakis,et al. Multiway cuts in node weighted graphs , 2004, J. Algorithms.
[2] Angsheng Li,et al. Algorithmic aspects of homophyly of networks , 2012, Theor. Comput. Sci..
[3] Juho Lauri,et al. Algorithms and hardness results for happy coloring problems , 2017, ArXiv.
[4] Rhyd Lewis,et al. Metaheuristics can solve sudoku puzzles , 2007, J. Heuristics.
[5] Manuel López-Ibáñez,et al. Construct , Merge , Solve & Adapt : A New General Algorithm For Combinatorial Optimization , 2015 .
[6] Anjeneya Swami Kare,et al. Linear Time Algorithms for Happy Vertex Coloring Problems for Trees , 2016, IWOCA.
[7] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[8] R. M. R. Lewis,et al. Guide to Graph Colouring: Algorithms and Applications , 2015, Texts in Computer Science.
[9] Alessandro Panconesi,et al. An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms , 2002, SODA '02.
[10] Rhyd Lewis,et al. Creating seating plans: a practical application , 2016, J. Oper. Res. Soc..
[11] Jano I. van Hemert,et al. Graph Coloring with Adaptive Evolutionary Algorithms , 1998, J. Heuristics.
[12] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[13] M. Kearns,et al. An Experimental Study of the Coloring Problem on Human Subject Networks , 2006, Science.
[14] Yun Fan,et al. On the phase transitions of random k-constraint satisfaction problems , 2011, Artif. Intell..
[15] Nicolas Zufferey,et al. A graph coloring heuristic using partial solutions and a reactive tabu scheme , 2008, Comput. Oper. Res..
[16] Nicholas C. Wormald,et al. Generating Random Regular Graphs Quickly , 1999, Combinatorics, Probability and Computing.
[17] Kerri Morgan,et al. Finding happiness: An analysis of the maximum happy vertices problem , 2019, Computers & Operations Research.
[18] Dániel Marx,et al. Parameterized graph separation problems , 2004, Theor. Comput. Sci..
[19] Christophe Bravard,et al. Homophily and Community Structure in Networks , 2016 .
[20] Albert-Lszl Barabsi,et al. Network Science , 2016, Encyclopedia of Big Data.
[21] Brian Everitt,et al. Cluster analysis , 1974 .
[22] Ali Ridha Mahjoub,et al. The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut , 2019, Discret. Appl. Math..
[23] Jonathan M. Thompson,et al. Tackling the edge dynamic graph colouring problem with and without future adjacency information , 2017, Journal of Heuristics.
[24] Peter Ross,et al. The Phase-Transition Niche for Evolutionary Algorithms in Timetabling , 1995, PATAT.