The DOI matches its Crossref record.
Cliques, Coloring, and Satisfiability
Overview
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
Cited by
Greedy Randomized Adaptive Search Procedures
Feo, T. A., & Resende, M. G. C. (1995) · Journal of Global Optimization · doi:10.1007/bf01096763 · Cited by 2,778
The worst-case time complexity for generating all maximal cliques and computational experiments
Tomita, E., Tanaka, A., & Takahashi, H. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.06.015 · Cited by 771
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Burer, S., & Monteiro, R. D. C. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0352-8 · Cited by 770
Authenticating Pervasive Devices with Human Protocols
Juels, A., & Weis, S. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_18 · Cited by 718
Alternating direction augmented Lagrangian methods for semidefinite programming
Wen, Z., Goldfarb, D., & Yin, W. (2010) · Mathematical Programming Computation · doi:10.1007/s12532-010-0017-1 · Cited by 359
A review on algorithms for maximum clique problems
Wu, Q., & Hao, J.-K. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.09.064 · Cited by 314
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
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
Finding Maximum Cliques on the D-Wave Quantum Annealer
Chapuis, G., Djidjev, H., Hahn, G., & Rizk, G. (2019) · Journal of Signal Processing Systems · doi:10.1007/s11265-018-1357-8 · Cited by 70
Metadata
- Venue
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Publisher
- American Mathematical Society
- Published
- 1996-10-01
- ISSN
- 1052-1798 (ISSN-L)
- 2472-4793
- OpenAlex
- W2607539118
- Cited by
- 476
- References
- 0
- FWCI
- 4.62
- Type
- book
- Language
- en
- Open access
- closed
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.