The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
LEMON – an Open Source C++ Graph Template Library
Open accessAbstract
This paper introduces LEMON, a generic open source C++ library providing easy-to-use and efficient implementations of graph and network algorithms and related data structures. The basic design concepts, features, and performance of LEMON are compared with similar software packages, namely BGL (Boost Graph Library) and LEDA. LEMON turned out to be a viable alternative to these widely used libraries, and our benchmarks show that it typically outperforms them in efficiency.
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
(1994) · Cited by 21,711
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
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
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Stroustrup, B. (1985) · Cited by 3,940
A new approach to the maximum-flow problem
Goldberg, A. V., & Tarjan, R. E. (1988) · Journal of the ACM · doi:10.1145/48014.61051 · Cited by 1,882
O’Regan, G. (2023) · Texts in Computer Science · doi:10.1007/978-3-031-26212-8_4 · Cited by 1,614
The LEDA platform for combinatorial and geometric computing
Mehlhorn, K., Näher, S., & Uhrig, C. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63165-8_161 · Cited by 1,199
Stanford GraphBase: A Platform for Combinatorial Computing, The
Knuth, D. E. (1993) · Cited by 927
The Boost graph library : user guide and reference manual
Siek, J. G., Lee, L., & Lumsdaine, A. (2002) · CERN Document Server (European Organization for Nuclear Research) · Cited by 608
LEDA: A platform for combinatorial and geometric computing
(2000) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)90217-7 · Cited by 489
An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm
Goldberg, A. V. (1997) · Journal of Algorithms · doi:10.1006/jagm.1995.0805 · Cited by 382
Finding Minimum-Cost Circulations by Successive Approximation
Goldberg, A. V., & Tarjan, R. E. (1990) · Mathematics of Operations Research · doi:10.1287/moor.15.3.430 · Cited by 335
(2012) · Linear Programming and Algorithms for Communication Networks · doi:10.1201/b12733-4 · Cited by 196
Cited by
Geographic information systems and science
(2011) · International Journal of Digital Earth · doi:10.1080/17538947.2011.582276 · Cited by 1,691
Geographic information systems and science
Retalis, A. (2005) · The Photogrammetric Record · doi:10.1111/j.1477-9730.2005.00343_5.x · Cited by 903
Geographic Information Systems and Science
(2019) · IntechOpen eBooks · doi:10.5772/intechopen.75243 · Cited by 305
PyMatching: A Python Package for Decoding Quantum Codes with Minimum-Weight Perfect Matching
Higgott, O. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3505637 · Cited by 181
Fusion Blossom: Fast MWPM Decoders for QEC
Wu, Y., & Zhong, L. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00107 · Cited by 47
Metadata
- Authors
- Dezső, B., Jüttner, A., & Kovács, P.
- Venue
- Electronic Notes in Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2011-07
- Volume
- 264
- Issue
- 5
- Pages
- 23-45
- ISSN
- 1571-0661 (ISSN-L)
- OpenAlex
- W2002792327
- Cited by
- 274
- References
- 15
- FWCI
- 15.87
- Type
- journal article
- Language
- en
- Open access
- diamond
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.