A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The Stanford GraphBase: a platform for combinatorial computing
The Stanford GraphBase: a platform for combinatorial computing
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
The boost graph library: user guide and reference manual
The boost graph library: user guide and reference manual
The C++ Programming Language
Introduction to Algorithms
Mixin-Based Programming in C++
GCSE '00 Proceedings of the Second International Symposium on Generative and Component-Based Software Engineering-Revised Papers
Automatic generation of software pipelines for heterogeneous parallel systems
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry
ACM Transactions on Graphics (TOG)
Scrubbing unit repositioning for fast error repair in FPGAs
Proceedings of the 2013 International Conference on Compilers, Architectures and Synthesis for Embedded Systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Hi-index | 0.00 |
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.