33 citations · 35 across the 2 of their papers we have counts for
2 papers
cs.NE2019★ 2 cited
Effective reinforcement learning based local search for the maximum k-plex problem
Yan Jin, John H. Drake, Una Benlic +1
The maximum k-plex problem is a computationally complex problem, which emerged from graph-theoretic social network studies. This paper presents an effective hybrid local search for…
cs.DM2015★ 33 cited
Algorithms for the minimum sum coloring problem: a review
Yan Jin, Jean-Philippe Hamiez, Jin-Kao Hao
The Minimum Sum Coloring Problem (MSCP) is a variant of the well-known vertex coloring problem which has a number of AI related applications. Due to its theoretical and practical r…