LEMON – an Open Source C++ Graph Template Library. 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. (Source: http://plato.asu.edu)
Keywords for this software
References in zbMATH (referenced in 4 articles , 1 standard article )
Showing results 1 to 4 of 4.
- Hager, William W.; Hungerford, James T.: Continuous quadratic programming formulations of optimization problems on graphs (2015)
- Kovács, Péter: Minimum-cost flow algorithms: an experimental evaluation (2015)
- Samer, Phillippe; Urrutia, Sebastián: A branch and cut algorithm for minimum spanning trees under conflict constraints (2015)
- Song, Yongjia; Luedtke, James R.: Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (2013)