Keyword

maximum clique problem

Description: The maximum clique problem is a computational graph problem that seeks the largest set of vertices in which every pair is connected.
Wikidata ID: wiki/Q1196873
OpenAlex ID: keywords/maximum-clique-problem
1974 · David S. Johnson · Journal of Computer and System Sciences · 2,211
1998 · Sanjeev Arora, Carsten Lund, et al. · Journal of the ACM · 1,569
1999 · Immanuel M. Bomze, Marco Budinich, et al. · Springer eBooks · 1,182
2002 · Patric R.J. Östergård · Discrete Applied Mathematics · 608
1990 · Randy Carraghan, Panos M. Pardalos · Operations Research Letters · 534
1999 · Ross M. McConnell, Jeremy P. Spinrad · Discrete Mathematics · 437
1994 · Panos M. Pardalos, Jue Xue · Journal of Global Optimization · 402
2014 · Qinghua Wu, Jin-Kao Hao · European Journal of Operational Research · 327
2006 · Gottlieb, Jens, Raidl, Günther R, et al. · Lecture notes in computer science · 326
1992 · Mark Jerrum · Random Structures and Algorithms · 326
1986 · Egon Balas, Chang Sung Yu · SIAM Journal on Computing · 311
2019 · Di Cao, Shan Chang, et al. · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · 292
1973 · David S. Johnson · ACM Symposium on Theory of Computing (STOC) · 287
1982 · U. I. Gupta, D. T. Lee, et al. · Networks · 274
1995 · George Kontoravdis, Jonathan F. Bard · INFORMS journal on computing · 249
2001 · R. Battiti, M. Protasi · Algorithmica · 235
2005 · Q. Zhang, J. Sun, et al. · IEEE Transactions on Evolutionary Computation · 229
1999 · J. Abello, Panos Pardalos, et al. · DIMACS series in discrete mathematics and theoretical computer science · 226
2001 · S. Khot · Annual Symposium on Foundations of Computer Science · 224
2003 · Etsuji Tomita, Tomokazu Seki · Lecture notes in computer science · 211
2018 · Joshua G. Mangelson, Derrick Dominic, et al. · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · 209
Works count: 1,923
Citation count: 34,720
Year
Topic
Type