LEDA
From MaRDI portal
swMATH509MaRDI QIDQ13265FDOQ13265
Author name not available (Why is that?)
Official website: http://www3.cs.stonybrook.edu/~algorith/implement/LEDA/implement.shtml
Cited In (only showing first 100 items - show all)
- An object-oriented design for graph visualization
- Minimum-cost flow algorithms: an experimental evaluation
- On the design of CGAL a computational geometry algorithms library
- JGAP: a Java-based graph algorithms platform
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- Title not available (Why is that?)
- JGraphT—A Java Library for Graph Data Structures and Algorithms
- Title not available (Why is that?)
- INGRID
- Title not available (Why is that?)
- JGAP
- Title not available (Why is that?)
- BRITE
- Edgebreaker
- Qhull
- Blossom V
- Blossom IV
- PPRN
- core 2
- MAPC
- LEMON
- MCF
- Miniball
- RelaxIV
- GTL
- PIGALE
- JGraphT
- SLEEF
- AutoGraphiX
- VRONI
- GeoWin
- approxBlackhole
- MCSTL
- gBlackhole
- STXXL
- CirclePack
- FindSteinerTree
- FIST
- Boost
- RealAlgebraic
- Treewidthlib
- GraphSET
- Grappa
- BALL
- BEAVER
- plantri
- 2D Arrangement
- 3D spherical kernel
- 2D triangulations
- Kinetic Framework
- Hull
- JUNG
- STL
- visone
- PRECISE
- Algorithm 447
- CS2
- MCFSimplex
- Traits
- ILIGRA
- Mathchem
- LUCY
- ESOLID
- GraphTheory
- MUMMER
- BGL
- CATBox
- GRAPH
- CAVER
- QuickHeapsort
- IRIT
- Matchbox
- Powercrust
- Voronoi
- BetaVoid
- CriticalPfreeGraphs
- BetaConcept
- Dijkstra Shortest Path
- NASA PVS
- Algorithm 360
- Maximum Cardinality Matching
- LibTW
- Leonardo
- Pavane
- POLKA
- Tango
- XTango
- Zeus
- Algorithms – ESA 2005
- The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
- ILIGRA: an efficient inverse line graph algorithm
- A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works
- MRC -- data structures and procedures for computing in monoid and group rings
- LOOK: A lazy object-oriented kernel design for geometric computation
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
- QuickHeapsort, an efficient mix of classical sorting algorithms
- Mining blackhole and volcano patterns in directed graphs: a general approach
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
This page was built for software: LEDA
