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 263 articles , 3 standard articles )

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

1 2 3 ... 12 13 14 next

  1. Al-Herz, Ahmed; Pothen, Alex: A (2/3)-approximation algorithm for vertex-weighted matching (2022)
  2. Fernandes, I. F. C.; Goldbarg, E. F. G.; Maia, S. M. D. M.; Goldbarg, M. C.: Empirical study of exact algorithms for the multi-objective spanning tree (2020)
  3. Michail, Dimitrios; Kinable, Joris; Naveh, Barak; Sichi, John V.: JGraphT -- a Java library for graph data structures and algorithms (2020)
  4. Dimitrios Michail, Joris Kinable, Barak Naveh, John V Sichi: JGraphT - A Java library for graph data structures and algorithms (2019) arXiv
  5. Ghebleh, Mohammad; Kanso, Ali; Stevanovic, Dragan: Graph6Java: a researcher-friendly Java framework for testing conjectures in chemical graph theory (2019)
  6. Pothen, Alex; Ferdous, S. M.; Manne, Fredrik: Approximation algorithms in combinatorial scientific computing (2019)
  7. Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman: Sequential and parallel algorithms and data structures. The basic toolbox (2019)
  8. Brandenburg, Franz J.: Recognizing optimal 1-planar graphs in linear time (2018)
  9. Juhl, Daniel; Warme, David M.; Winter, Pawel; Zachariasen, Martin: The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (2018)
  10. Naeher, Stefan: LEDA, a platform for combinatorial and geometric computing (2018)
  11. Reich, Alexander: Classification of robust cycle bases and relations to fundamental cycle bases (2018)
  12. Subramani, K.; Wojciechowski, Piotr: A certifying algorithm for lattice point feasibility in a system of UTVPI constraints (2018)
  13. Wilhelm, Martin: Restructuring expression dags for efficient parallelization (2018)
  14. Mehlhorn, Kurt; Neumann, Adrian; Schmidt, Jens M.: Certifying 3-edge-connectivity (2017)
  15. Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
  16. Bian, Zhengbing; Gu, Qian-Ping; Zhu, Mingzhe: Practical algorithms for branch-decompositions of planar graphs (2016)
  17. Lee, Mokwon; Sugihara, Kokichi; Kim, Deok-Soo: Topology-oriented incremental algorithm for the robust construction of the Voronoi diagrams of disks (2016)
  18. Marzban, Marjan; Gu, Qian-Ping; Jia, Xiaohua: New analysis and computational study for the planar connected dominating set problem (2016)
  19. 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)
  20. Cymer, Radosław: Gallai-Edmonds decomposition as a pruning technique (2015)

1 2 3 ... 12 13 14 next