In the core computer science areas -- data structures, graph and network algorithms, and computational geometry -- LEDA is the first library to cover all material found in the standard textbooks. Written in C++ and freely available worldwide on a variety of hardware, the software is installed at hundreds of sites. This book, written by the main authors of LEDA, is the definitive account of how the system operates and how it can be used. The authors supply plentiful examples from a range of areas to show practical uses of the library, making the book essential for all researchers in algorithms, data structures and computational geometry.

References in zbMATH (referenced in 193 articles , 1 standard article )

Showing results 1 to 20 of 193.
Sorted by year (citations)

1 2 3 ... 8 9 10 next

  1. Mehlhorn, Kurt; Neumann, Adrian; Schmidt, Jens M.: Certifying 3-edge-connectivity (2017)
  2. Bian, Zhengbing; Gu, Qian-Ping; Zhu, Mingzhe: Practical algorithms for branch-decompositions of planar graphs (2016)
  3. Lee, Mokwon; Sugihara, Kokichi; Kim, Deok-Soo: Topology-oriented incremental algorithm for the robust construction of the Voronoi diagrams of disks (2016)
  4. Marzban, Marjan; Gu, Qian-Ping; Jia, Xiaohua: New analysis and computational study for the planar connected dominating set problem (2016)
  5. Bannister, Michael J.; Devanny, William E.; Eppstein, David; Goodrich, Michael T.: The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings (2015)
  6. Cymer, Radosław: Gallai-Edmonds decomposition as a pruning technique (2015)
  7. Kovács, Péter: Minimum-cost flow algorithms: an experimental evaluation (2015)
  8. Liu, Dajie; Trajanovski, Stojan; van Mieghem, Piet: ILIGRA: an efficient inverse line graph algorithm (2015)
  9. Noschinski, Lars: A graph library for Isabelle (2015)
  10. Alkassar, Eyad; Böhme, Sascha; Mehlhorn, Kurt; Rizkallah, Christine: A framework for the verification of certifying computations (2014)
  11. Nguyen, Trung Thanh; Rothe, Jörg: Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (2014)
  12. Aouchiche, Mustapha; Caporossi, Gilles; Hansen, Pierre: Open problems on graph eigenvalues studied with AutoGraphiX (2013)
  13. Bringmann, Karl; Friedrich, Tobias: Exact and efficient generation of geometric random variates and random graphs (2013)
  14. Kramberger, T.; Žerovnik, J.; Štrubelj, G.; Prah, K.: GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance (2013)
  15. Nguyen, Trung Thanh; Rothe, Jörg: How to decrease the degree of envy in allocations of indivisible goods (2013)
  16. Aichholzer, Oswin; Aigner, Wolfgang; Hackl, Thomas; Wolpert, Nicola: Exact medial axis computation for circular arc boundaries (2012)
  17. Doerr, Benjamin; Happ, Edda; Klein, Christian: Crossover can provably be useful in evolutionary computation (2012)
  18. Edelkamp, Stefan; Elmasry, Amr; Katajainen, Jyrki: The weak-heap data structure: variants and applications (2012)
  19. Liers, F.; Pardella, G.: Partitioning planar graphs: a fast combinatorial approach for max-cut (2012)
  20. Li, Zhongmou; Xiong, Hui; Liu, Yanchi: Mining blackhole and volcano patterns in directed graphs: a general approach (2012)

1 2 3 ... 8 9 10 next