Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,257,115 papers from all fields of science
Search
Sign In
Create Free Account
Library of Efficient Data types and Algorithms
Known as:
Leda
The Library of Efficient Data types and Algorithms (LEDA) is a proprietarily-licensed software library providing C++ implementations of a broad…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Algorithm engineering
Bentley–Ottmann algorithm
C++
CGAL
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Does functional trait diversity predict above‐ground biomass and productivity of tropical forests? Testing three alternative hypotheses
B. Finegan
,
M. Peña-Claros
,
+12 authors
L. Poorter
2015
Corpus ID: 73640224
Tropical forests are globally important, but it is not clear whether biodiversity enhances carbon storage and sequestration in…
Expand
Highly Cited
2009
Highly Cited
2009
Blossom V: a new implementation of a minimum cost perfect matching algorithm
V. Kolmogorov
Mathematical Programming Computation
2009
Corpus ID: 17864814
We describe a new implementation of the Edmonds’s algorithm for computing a perfect matching of minimum cost, to which we refer…
Expand
Review
2008
Review
2008
The LEDA Traitbase: a database of life‐history traits of the Northwest European flora
M. Kleyer
,
R. Bekker
,
+31 authors
B. Peco
2008
Corpus ID: 52064839
1 An international group of scientists has built an open internet data base of life‐history traits of the Northwest European…
Expand
Highly Cited
2004
Highly Cited
2004
Complex networks
T. Evans
2004
Corpus ID: 1147163
An outline of recent work on complex networks is given from the point of view of a physicist. Motivation, achievements and goals…
Expand
Highly Cited
2003
Highly Cited
2003
Recovering documentation-to-source-code traceability links using latent semantic indexing
Andrian Marcus
,
J. Maletic
25th International Conference on Software…
2003
Corpus ID: 7730498
An information retrieval technique, latent semantic indexing, is used to automatically identify traceability links from system…
Expand
Highly Cited
2002
Highly Cited
2002
Round-robin Arbiter Design and Generation
V. Mooney
,
G. Riley
,
Eung S. Shin
15th International Symposium on System Synthesis…
2002
Corpus ID: 5289388
In this paper, we introduce a Round-robin Arbiter Generator (RAG) tool. The RAG tool can generate a design for a Bus Arbiter (BA…
Expand
Review
2001
Review
2001
The Boost Graph Library - User Guide and Reference Manual
Jeremy G. Siek
,
Lie-Quan Lee
,
A. Lumsdaine
C++ in-depth series
2001
Corpus ID: 39373792
Foreword. Preface. I User Guide. 1. Introduction. Some Graph Terminology. Graph Concepts. Vertex and Edge Descriptors. Property…
Expand
Highly Cited
1997
Highly Cited
1997
LEDA: a platform for combinatorial and geometric computing
S. Näher
CACM
1997
Corpus ID: 2560175
Combinatorial and geometric computing is a core area of computer science (CS). In fact, most CS curricula contain a course in…
Expand
Highly Cited
1997
Highly Cited
1997
Handbook of Discrete and Computational Geometry, Second Edition
J. Goodman
,
J. O'Rourke
1997
Corpus ID: 11802975
COMBINATORIAL AND DISCRETE GEOMETRY Finite Point Configurations, J. Pach Packing and Covering, G. Fejes Toth Tilings, D…
Expand
Highly Cited
1989
Highly Cited
1989
LEDA: A Library of Efficient Data Types and Algorithms
S. Näher
Symposium on Theoretical Aspects of Computer…
1989
Corpus ID: 13458945
LEDA is a library of efficient data types and algorithms. At present, its strength is graph algorithms and related data…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE