The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Graph Algorithms
Abstract
Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.
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
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Fibonacci heaps and their uses in improved network optimization algorithms
Fredman, M. L., & Tarjan, R. E. (1987) · Journal of the ACM · doi:10.1145/28869.28874 · Cited by 3,132
A Note on Dijkstra's Shortest Path Algorithm
Johnson, D. B. (1973) · Journal of the ACM · doi:10.1145/321765.321768 · Cited by 380
Cited by
From networks to optimal higher-order models of complex systems
Lambiotte, R., Rosvall, M., & Scholtes, I. (2019) · Nature Physics · doi:10.1038/s41567-019-0459-y · Cited by 483
Distribution System Restoration With Microgrids Using Spanning Tree Search
Li, J., Ma, X.-Y., Liu, C.-C., & Schneider, K. P. (2014) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2014.2312424 · Cited by 372
Exploiting Massive D2D Collaboration for Energy-Efficient Mobile Edge Computing
Chen, X., Pu, L., Gao, L., Wu, W., & Wu, D. (2017) · IEEE Wireless Communications · doi:10.1109/mwc.2017.1600321 · Cited by 239
Identifiability and experimental design in perturbation studies
Gross, T., & Blüthgen, N. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa404 · Cited by 11
Metadata
- Authors
- Even, S.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2011-09-19
- OpenAlex
- W2967057359
- Cited by
- 218
- References
- 3
- FWCI
- 2.22
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Graph Algorithms. https://app.cochat.ai/papers/10.1017/cbo9781139015165
- The paper
- Even, S. (2011). Graph Algorithms. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9781139015165
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.