The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
A review on algorithms for maximum clique problems
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ballard, D. H., & Brown, C. M. (1982) · Cited by 5,303
(2003) · International Series in Operations Research & Management Science · doi:10.1007/b101874 · Cited by 3,430
Complexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
Reducibility Among Combinatorial Problems
Karp, R. M. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_8 · Cited by 2,490
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
New methods to color the vertices of a graph
Brélaz, D. (1979) · Communications of the ACM · doi:10.1145/359094.359101 · Cited by 1,567
Clique is hard to approximate within n1−ε
Håstad, J. (1999) · Acta Mathematica · doi:10.1007/bf02392825 · Cited by 1,369
(2000) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)90183-4 · Cited by 1,263
Handbook of Combinatorial Optimization
(1999) · Springer eBooks · doi:10.1007/978-1-4757-3023-4 · Cited by 1,216
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
(2014) · A Primer on Auction Design, Management, and Strategy · doi:10.7551/mitpress/8637.003.0011 · Cited by 923
Graph Theory: An Algorithmic Approach
Kay, E. (1976) · Journal of the Operational Research Society · doi:10.1057/jors.1976.202 · Cited by 902
Cramton, P., Shoham, Y., & Steinberg, R. (2005) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033428.001.0001 · Cited by 902
Maxima for Graphs and a New Proof of a Theorem of Turán
Motzkin, T. S., & Straus, E. G. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-053-6 · Cited by 710
Hyper-Heuristics: An Emerging Direction in Modern Search Technology
Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., & Schulenburg, S. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_16 · Cited by 665
Vertex packings: Structural properties and algorithms
Nemhauser, G. L., & Trotter, L. E. (1975) · Mathematical Programming · doi:10.1007/bf01580444 · Cited by 664
Proceedings 35th Annual Symposium on Foundations of Computer Science
(1994) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365747 · Cited by 593
Feige, U., Peleg, D., & Kortsarz, G. (2001) · Algorithmica · doi:10.1007/s004530010050 · Cited by 592
A fast algorithm for the maximum clique problem
Östergård, P. R. J. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00290-6 · Cited by 590
Cliques, Coloring, and Satisfiability
(1996) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/026 · Cited by 476
Impact of Interference on Multi-Hop Wireless Network Performance
Jain, K., Padhye, J., Padmanabhan, V. N., & Qiu, L. (2005) · Wireless Networks · doi:10.1007/s11276-005-1769-9 · Cited by 404
Linear degree extractors and the inapproximability of max clique and chromatic number
Zuckerman, D. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132612 · Cited by 398
Pardalos, P. M., & Xue, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01098364 · Cited by 382
Massive Quasi-Clique Detection
Abello, J., Resende, M. G. C., & Sudarsky, S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45995-2_51 · Cited by 331
Genetic and hybrid algorithms for graph coloring
Fleurent, C., & Ferland, J. A. (1996) · Annals of Operations Research · doi:10.1007/bf02125407 · Cited by 309
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Balasundaram, B., Butenko, S., & Hicks, I. V. (2011) · Operations Research · doi:10.1287/opre.1100.0851 · Cited by 302
Mining market data: A network approach
Boginski, V., Butenko, S., & Pardalos, P. M. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2005.01.027 · Cited by 283
On mining cross-graph quasi-cliques
Pei, J., Jiang, D., & Zhang, A. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081898 · Cited by 246
2014 IEEE 30th International Conference on Data Engineering
(2014) · doi:10.1109/icde30119.2014 · Cited by 235
An Evolutionary Algorithm With Guided Mutation for the Maximum Clique Problem
Zhang, Q., Sun, J., & Tsang, E. P. K. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.840835 · Cited by 229
An iterative approach to robust and integrated aircraft routing and crew scheduling
Weide, O., Ryan, D. M., & Ehrgott, M. (2009) · Computers & Operations Research · doi:10.1016/j.cor.2009.03.024 · Cited by 167
Dynamic Local Search for the Maximum Clique Problem
Pullan, W., & Hoos, H. H. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1815 · Cited by 158
Approximating Maximum Clique by Removing Subgraphs
Feige, U. (2004) · SIAM Journal on Discrete Mathematics · doi:10.1137/s089548010240415x · Cited by 157
Memetic Algorithms in Discrete Optimization
Hao, J. (2011) · Studies in computational intelligence · doi:10.1007/978-3-642-23247-3_6 · Cited by 127
Self-citationSolving the maximum clique problem using a tabu search approach
Michel Gendreau, A., Patrick Soriano, A., & Salvail, L. (1993) · Annals of Operations Research · doi:10.1007/bf02023002 · Cited by 120
Identification of a 5-Protein Biomarker Molecular Signature for Predicting Alzheimer's Disease
Ravetti, M. G., & Moscato, P. (2008) · PLoS ONE · doi:10.1371/journal.pone.0003111 · Cited by 120
A new trust region technique for the maximum weight clique problem
Busygin, S. (2006) · Discrete Applied Mathematics · doi:10.1016/j.dam.2005.04.010 · Cited by 119
Classifying molecular sequences using a linkage graph with their pairwise similarities
Matsuda, H., Ishihara, T., & Hashimoto, A. (1999) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00091-7 · Cited by 116
Multi-neighborhood tabu search for the maximum weight clique problem
Wu, Q., Hao, J., & Glover, F. (2012) · Annals of Operations Research · doi:10.1007/s10479-012-1124-3 · Cited by 115
Self-citationModelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem
Dorndorf, U., Jaehn, F., & Pesch, E. (2008) · Transportation Science · doi:10.1287/trsc.1070.0211 · Cited by 107
Approximating the maximum weight clique using replicator dynamics
Stix, V., Pelillo, M., & Bomze, I. M. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.883403 · Cited by 107
Breakout Local Search for maximum clique problems
Benlic, U., & Hao, J. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2012.06.002 · Cited by 101
Self-citationOut-of-core coherent closed quasi-clique mining from large dense graph databases
Zeng, Z., Wang, J., Zhou, L., & Karypis, G. (2007) · ACM Transactions on Database Systems · doi:10.1145/1242524.1242530 · Cited by 101
Heuristics and metaheuristics for the maximum diversity problem
Martí, R., Gallego, M., Duarte, A., & Pardo, E. G. (2011) · Journal of Heuristics · doi:10.1007/s10732-011-9172-4 · Cited by 99
Graph Domination, Coloring and Cliques in Telecommunications
Balasundaram, B., & Butenko, S. I. (2008) · Springer eBooks · doi:10.1007/978-0-387-30165-5_30 · Cited by 95
A study of ACO capabilities for solving the maximum clique problem
Solnon, C., & Fenet, S. (2006) · Journal of Heuristics · doi:10.1007/s10732-006-4295-8 · Cited by 93
On Effectively Finding Maximal Quasi-cliques in Graphs
Brunato, M., Hoos, H. H., & Battiti, R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-92695-5_4 · Cited by 91
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Grosso, A., Locatelli, M., & Pullan, W. (2007) · Journal of Heuristics · doi:10.1007/s10732-007-9055-x · Cited by 90
An effective local search for the maximum clique problem
Katayama, K., Akihiro, H., & Narihisa, H. (2005) · Information Processing Letters · doi:10.1016/j.ipl.2005.05.010 · Cited by 83
Clique Relaxation Models in Social Network Analysis
Pattillo, J., Youssef, N., & Butenko, S. I. (2011) · Springer optimization and its applications · doi:10.1007/978-1-4614-0857-4_5 · Cited by 79
Phased local search for the maximum clique problem
Pullan, W. (2006) · Journal of Combinatorial Optimization · doi:10.1007/s10878-006-9635-y · Cited by 73
An extended formulation approach to the edge-weighted maximal clique problem
Park, K., Lee, K., & Park, S. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00299-5 · Cited by 66
A tabu search based memetic algorithm for the maximum diversity problem
Wang, Y., Hao, J., Glover, F., et al. (2013) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2013.09.005 · Cited by 63
Self-citationMaximum stable set formulations and heuristics based on continuous optimization
Burer, S., Monteiro, R. D. C., & Zhang, Y. (2002) · Mathematical Programming · doi:10.1007/s10107-002-0356-4 · Cited by 58
Maximum independent set and related problems, with applications
Butenko, S. I., & Pardalos, P. M. (2003) · Cited by 48
Distributing an Exact Algorithm for Maximum Clique: maximising the costupPreprint
McCreesh, C., & Prosser, P. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1209.4560 · Cited by 47
A cutting-plane approach to the edge-weighted maximal clique problem
van Dijkhuizen, G. C., & Faigle, U. (1993) · European Journal of Operational Research · doi:10.1016/0377-2217(93)90097-7 · Cited by 44
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
Massaro, A., Pelillo, M., & Bomze, I. M. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623400381413 · Cited by 42
Guturu, P., & Dantu, R. (2008) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2008.915645 · Cited by 38
A New Algorithm for the Maximum-Weight Clique Problem
Östergård, P. R. J. (1999) · Electronic Notes in Discrete Mathematics · doi:10.1016/s1571-0653(05)80045-9 · Cited by 33
Maximum Cliques in Protein Structure Comparison
Malod‐Dognin, N., Andonov, R., & Yanev, N. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13193-6_10 · Cited by 31
Branch and bound algorithms for the maximum clique problem under a unified framework
Carmo, R., & Züge, A. P. (2011) · Journal of the Brazilian Computer Society · doi:10.1007/s13173-011-0050-6 · Cited by 23
Cliques with maximum/minimum edge neighborhood and neighborhood density
Martins, P. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2011.04.016 · Cited by 13
Cited by
TEASER: Fast and Certifiable Point Cloud Registration
Yang, H., Shi, J., & Carlone, L. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.3033695 · Cited by 895
Applications of near-term photonic quantum computers: software and algorithms
Bromley, T. R., Arrazola, J. M., Jahangiri, S., Izaac, J., Quesada, N., Gran, A. D., Schuld, M., Swinarton, J., Zabaneh, Z., & Killoran, N. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8504 · Cited by 128
Metadata
- Authors
- Wu, Q., & Hao, J.-K.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2015-05
- Volume
- 242
- Issue
- 3
- Pages
- 693-709
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2037016941
- Cited by
- 314
- References
- 63
- FWCI
- 21.44
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.