Keyword

clique problem

Description: The clique problem is a computational graph theory problem of finding a complete subgraph of a specified size or maximum size.
Wikidata ID: wiki/Q1196873
OpenAlex ID: keywords/clique-problem
1990 · Brent N. Clark, Charles J. Colbourn, et al. · Discrete Mathematics · 1,624
1999 · Johan Håstad · Acta Mathematica · 1,559
1998 · Sanjeev Arora, Shmuel Safra · Journal of the ACM · 1,466
2001 · F. McSherry · Annual Symposium on Foundations of Computer Science · 729
1988 · Mark W. Krentel · Journal of Computer and System Sciences · 526
1984 · M. Grötschel, L. Lovász, et al. · North-Holland mathematics studies · 464
2002 · U. Feige, S. Goldwasser, et al. · Annual Symposium on Foundations of Computer Science · 438
1986 · László Lovász · Society for Industrial and Applied Mathematics eBooks · 404
1992 · Ravi Boppana, Magnús M. Halldórsson · BIT Numerical Mathematics · 402
1984 · C.H. Papadimitriou, M. Yannakakis · Journal of Computer and System Sciences · 353
2006 · Jianer Chen, Xiuzhen Huang, et al. · Journal of Computer and System Sciences · 347
1985 · Jaroslav Nešetřil, Svatopluk Poljak · Czech digital mathematics library · 339
2014 · Hans L. Bodlaender, Bart M. P. Jansen, et al. · SIAM Journal on Discrete Mathematics · 318
1982 · Neil Immerman · Journal of Computer and System Sciences · 289
1998 · Sanjeev Khanna, Rajeev Motwani, et al. · SIAM Journal on Computing · 215
1972 · S. Even, A. Pnueli, et al. · Journal of the ACM · 206
1997 · Johan Håstad · Electronic colloquium on computational complexity · 185
2004 · Jiong Guo, Falk Hüffner, et al. · Lecture notes in computer science · 153
2002 · Yuichi Asahiro, Refael Hassin, et al. · Discrete Applied Mathematics · 150
1997 · Babette Fluiter · Utrecht University Repository (Utrecht University) · 141
1984 · F. S. Kuhl, G. M. Crippen, et al. · Journal of Computational Chemistry · 138
2015 · Amir Abboud, Arturs Backurs, et al. · SIAM Journal on Computing · 137
1982 · C. H. Papadimitriou, M. Yannakakis · ACM Symposium on Theory of Computing (STOC) · 137
2004 · Jianer Chen, Xiuzhen Huang, et al. · ACM Symposium on Theory of Computing (STOC) · 125
Works count: 673
Citation count: 18,590
Year
Topic
Type