The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Detecting critical nodes in sparse graphs
Overview
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Introduction to Operations Research
Leimkuhler, F. F. (1968) · Technometrics · doi:10.1080/00401706.1968.10490578 · Cited by 3,405
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,371
Network flows: Theory, algorithms and applications
(1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90171-6 · Cited by 2,585
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
Cited by
Finding key players in complex networks through deep reinforcement learning
Fan, C., Zeng, L., Sun, Y., & Liu, Y.-Y. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-0177-2 · Cited by 425
Literature review: The vaccine supply chain
Duijzer, L. E., van Jaarsveld, W., & Dekker, R. (2018) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.01.015 · Cited by 258
Metadata
- Authors
- Arulselvan, A., Commander, C. W., Elefteriadou, L., & Pardalos, P. M.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2009-07
- Volume
- 36
- Issue
- 7
- Pages
- 2193-2200
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2121035174
- Cited by
- 381
- References
- 22
- FWCI
- 11.32
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Detecting critical nodes in sparse graphs. https://app.cochat.ai/papers/10.1016/j.cor.2008.08.016
- The paper
- Arulselvan, A., Commander, C. W., Elefteriadou, L., & Pardalos, P. M. (2009). Detecting critical nodes in sparse graphs. Computers & Operations Research. https://doi.org/10.1016/j.cor.2008.08.016
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.
