K. Mehlhorn and S. Naher. LEDA, a platform for combinatorial and geometric computing. Communications of the ACM, 38(1):96--102, 1995. Home/Search Document Not in Database Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Balancing Sparse Hamiltonian Eigenproblems - Benner, Kressner (2003) (Correct)
....Fortran 77 [11] In an object oriented programming environment, it is preferable to use an implementation which is able to handle arbitrarily defined graphs. In this case, no information about the incidence graph has to be stored. Such subroutines are for example provided by the C library LEDA [17]. The complete Algorithm 7 runs in O(n nz) time, where nz is the number of nonzero in H. The permutation algorithm proposed in [4, Alg. 3.4] is a special case of Algorithm 7. It is a structure preserving version of the permutation algorithm from [21] that is used, e.g. in LAPACK [2] for ....
K. Mehlhorn and S. Naher. LEDA. A platform for combinatorial and geometric computing. Cambridge University Press, Cambridge, 1999.
An Efficient Algorithm for Weakly Normal Dominance.. - Bodirsky, Duchier.. (Correct)
....X. Biconnected components form a proper partition of the graph edges. It is standard to compute a mapping from each edge in a graph to a unique number of its biconnected component. For a graph with n vertices and m edges this can be done in time O(n m) using depth rst search (see e.g. [11]) Now we can compute the set of free root variables in linear time. We use a control bit for each biconnected component. When processing a root 11 candidate X, we can use the bit to check for each child Y whether the number of the edge (X; Y ) has already occurred at another child of X. Since we ....
K. Mehlhorn and S. Naher. LEDA. A platform for combinatorial and geometric computing. Cambridge University Press, Cambridge, 1999.
Simulated Annealing with Estimated Temperature - Poupaert, Deville (2000) (1 citation) (Correct)
....must use a finite initial temperature. 4. Experiments In order to evaluate our algorithm and to compare it to other classical simulated annealing algorithms, we designed and implemented a general local search optimisation platform. This platform is written in C using the LEDA library [9]. A graphical interface written in Tcl Tk is also provided. Source code is available upon request to the first author. 24 E. Poupaert and Y. Deville Simulated Annealing with estimated temperature This platform is designed such that local search algorithms and optimisation problems are ....
K. Mehlhorn and S. Nher, LEDA, a platform for combinatorial and geometric computing, CACM 38(1) (1995), 96--102.
A Polyhedral Approach to Sequence Alignment Problems - Kececioglu, Lenhof.. (1999) (6 citations) Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA, a platform for combinatorial and geometric computing. Communications of the ACM, 38(1):96--102, 1995.
Maximum Network Flow with Floating Point Arithmetic - Ernst Althaus Kurt (1997) (1 citation) Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher. Leda, a platform for combinatorial and geometric computing. Communications of the ACM, 38:96-102, 1995.
Infimaximal Frames - Technique For Making Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA, A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Extending LEDA to Secondary Memory - Andreas Crauser And (1999) Self-citation (Mehlhorn) (Correct)
No context found.
K. Mehlhorn and S. Naher. LEDA, a platform for combinatorial and geometric computing. Communications of the ACM, 38:96-102, 1995.
On the performance of LEDA-SM - Crauser, Mehlhorn, Althaus, Brengel, .. (1997) Self-citation (Mehlhorn) (Correct)
....was designed to close that gap. LEDA SM is a prototype library that supports I O efficient data structures that can be used in many applications. To circumvent the rewriting of efficient algorithms and data structures for in core problems, LEDA SM is designed as an extension of the LEDA library [MN95] and hence requires to be used together with LEDA. LEDA SM provides a sizable collection of data types and algorithms in a form which allows them to be used by non experts. LEDA SM gives a pre4 cise and readable specification for each of the data types and algorithms. The specifications are short ....
K. Mehlhorn and S. Naher. Leda, a platform for combinatorial and geometric computing. Communications of the ACM, 38:96-- 102, 1995.
All-Pairs Shortest-Paths Computation in the.. - Mehlhorn, Priebe, .. (2001) Self-citation (Mehlhorn) (Correct)
....Our algorithm uses only standard algorithmic building blocks such as the computation of strongly connected components, Dijkstra s algorithm, or the Bellman Ford algorithm, which are well studied and easy to implement. An implementation of our algorithm will become part of the LEDA software package [8] in the near future. Acknowledgements The authors thank Jesper Larsson Tr a and the anonymous referees for helpful comments on the presentation. ....
K. Mehlhorn, S. Naher, LEDA. A Platform for Combinatorial and Geometric Computing, Cambridge University Press, Cambridge, 1999.
Improved Symmetric Lists - Bachmaier, Raitner (2004) (2 citations) (Correct)
No context found.
K. Mehlhorn and S. N aher. LEDA, A Platform for Combinatorial and Geometric Computing, chapter 3.2. Cambridge University Press, 1999.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2005) (2 citations) (Correct)
No context found.
K. Mehlhorn and S. Nher. LEDA, A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2003) (2 citations) (Correct)
No context found.
K. Mehlhorn and S. N aher. LEDA, A Platform for Combinatorial and Geometric Computing, chapter 8.7. Cambridge University Press, 1999.
Improved Symmetric Lists - Bachmaier (2004) (2 citations) (Correct)
No context found.
K. Mehlhorn and S. N aher. LEDA, A Platform for Combinatorial and Geometric Computing, chapter 3.2. Cambridge University Press, 1999.
Improved Symmetric Lists - Bachmaier, Raitner (2004) (2 citations) (Correct)
No context found.
K. Mehlhorn and S. N aher. LEDA, A Platform for Combinatorial and Geometric Computing, chapter 3.2. Cambridge University Press, 1999.
Geometric Shortest Path Containers - Wagner, Willhalm, Zaroliagis (2004) (Correct)
No context found.
K. Mehlhorn, S. Naher; LEDA, A platform for Combinatorial and Geometric Computing ; Cambridge University Press; 1999
Geometric Speed-Up Techniques for Finding Shortest Paths in.. - Wagner, Willhalm (2003) (1 citation) (Correct)
No context found.
Mehlhorn, K., Naher, S.: LEDA, A platform for Combinatorial and Geometric Computing. Cambridge University Press (1999)
Allocation of Spare Capacity for Shared Protection of Optical.. - Mauz (1 citation) (Correct)
No context found.
K. Mehlhorn and S. Naher, LEDA, A Platform for Combinatorial and Geometric Computing, Cambridge University Press, 1999, http://www.mpi-sb.mpg.de/LEDA/leda.html.
Improved Symmetric Lists - Bachmaier, Raitner (2004) (2 citations) (Correct)
No context found.
K. Mehlhorn and S. N aher. LEDA, A Platform for Combinatorial and Geometric Computing, chapter 3.2. Cambridge University Press, 1999.
Radial Level Planarity Testing and Embedding - In Linear Time (Correct)
No context found.
K. Mehlhorn and S. N aher. LEDA, A Platform for Combinatorial and Geometric Computing, chapter 8.7. Cambridge University Press, 1999.
Dual graph contraction with LEDA - Kropatsch, Burge, Yacoub, Selmaoui (1998) (Correct)
No context found.
K. Mehlhorn and S. Naher. Leda, a platform for combinatorial and geometric computing. Communications of ACM, Vol. 38(1):96--102, 1995.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2005) (2 citations) (Correct)
No context found.
K. Mehlhorn and S. N aher. LEDA, A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
Art of Graph Drawing and Art - Nesetril (2001) (1 citation) (Correct)
No context found.
K. Mehlhorn, and S. Naher. LEDA{A platform for combinatorial and geometric computing. Cambridge Univ. Press, 1999.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2003) (2 citations) (Correct)
No context found.
K. Mehlhorn and S. N aher. LEDA, A Platform for Combinatorial and Geometric Computing, chapter 8.7. Cambridge University Press, 1999.
Accumulating Jacobians as Chained Sparse Matrix Products - Griewank, Naumann (2002) (Correct)
No context found.
K. Mehlhorn and S. N aher, LEDA, a platform for combinatorial and geometric computing, Communications of ACM, Vol. 38, no. 1, pp. 96-102, 1995.
An Enhanced Markowitz Rule For Accumulating Jacobian Matrices.. - Naumann (2000) (Correct)
No context found.
K. MEHLHORN AND S. NHER, LEDA, a platform for combinatorial and geometric com- puting, Communications of ACM, Vol. 38, no. 1, pp. 96-102, 1995.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC