The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Unit disk graphs
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1979) · Cited by 43,841
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Algorithmic Graph Theory and Perfect Graphs
(2004) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(04)x8001-8 · Cited by 3,729
Complexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Edmonds, J., & Karp, R. M. (1972) · Journal of the ACM · doi:10.1145/321694.321699 · Cited by 2,528
Some simplified NP-complete graph problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90059-1 · Cited by 2,059
Self-citationThe Location of Emergency Service Facilities
Toregas, C., Swain, R. W., ReVelle, C., & Bergman, L. A. (1971) · Operations Research · doi:10.1287/opre.19.6.1363 · Cited by 1,896
Frequency assignment: Theory and applications
Hale, W. K. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11899 · Cited by 1,344
The Rectilinear Steiner Tree Problem is $NP$-Complete
Garey, M. R., & Johnson, D. S. (1977) · SIAM Journal on Applied Mathematics · doi:10.1137/0132071 · Cited by 1,124
Self-citationThe NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
Self-citation
Cited by
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
Wan, P.-J., Alzoubi, K. M., & Frieder, O. (2004) · Mobile Networks and Applications · doi:10.1023/b:mone.0000013625.87793.13 · Cited by 657
Distributed construction of connected dominating set in wireless ad hoc networks
Wan, P.-J., Alzoubi, K. M., & Frieder, O. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019411 · Cited by 628
Quantum optimization of maximum independent set using Rydberg atom arrays
Ebadi, S., Keesling, A., Cain, M., Wang, T. T., Levine, H., Bluvstein, D., Semeghini, G., Omran, A., Liu, J.-G., Samajdar, R., et al. (2022) · Science · doi:10.1126/science.abo6587 · Cited by 430
Unit disk graph recognition is NP-hard
Breu, H., & Kirkpatrick, D. G. (1998) · Computational Geometry · doi:10.1016/s0925-7721(97)00014-x · Cited by 312
Challenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201
“Here, we suggest an empirical approach to identify more generally applicable quantum heuristics and less formal problem structures in which these heuristics have an advantage in certain instances.”
Metadata
- Authors
- Clark, B. N., Colbourn, C. J., & Johnson, D. S.
- Venue
- Discrete Mathematics
- Publisher
- Elsevier BV
- Published
- 1990-12
- Volume
- 86
- Issue
- 1-3
- Pages
- 165-177
- ISSN
- 0012-365X (ISSN-L)
- OpenAlex
- W2063572899
- Cited by
- 1,429
- References
- 16
- FWCI
- 1.46
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Unit disk graphs. https://app.cochat.ai/papers/10.1016/0012-365x(90)90358-o
- The paper
- Clark, B. N., Colbourn, C. J., & Johnson, D. S. (1990). Unit disk graphs. Discrete Mathematics. https://doi.org/10.1016/0012-365x(90)90358-o
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.