N aher, S. The LEDA manual, Version R-3.4.1. Tech. rep., Max-Planck-Institut fur Informatik, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Static And Dynamic Reverse Engineering Techniques for Java.. - Systä (2000) (1 citation) (Correct)
....so that porting to Unix with OSF Motif should be possible with moderate effort. These tools, versions of which have been changed several times during the development of SCED, are: 1. Borland C C language compiler [31, 108, 109] 2. LEDA Library of Efficient Data types and Algorithms [75]. Portable across wide range of platforms. 3. wxWindows GUI library [101] Portable between MS Windows, Windows NT, Motif, Open Look. 38 4.1 Dynamic modeling using SCED SCED offers two diagrams for dynamic modeling: a scenario diagram and a state diagram. Scenarios and state diagrams are ....
N aher S., LEDA User Manual, Version 3.0. Max-Planck-Institut f ur Informatik, 1992.
Computing Visibility Polygons with LEDA - Hipke (1996) (Correct)
....computing the visibility polygon will be embedded in a C class vis polygon. We use the LEDA library and the new data type then is an extension to the functionality of this library. LEDA supports combinatorial and geometric computing, it has been developed at the Max Planck Institut Saarbrucken [5, 8]. Here we are using some of its geometric functions. 2 2. Description of the algorithm. In this section we will describe the algorithm for computing the visibility polygon of a point p inside a simple polygon P . The first linear time algorithm for computing the visibility polygon of a point ....
Stefan Naher und Christian Uhrig. LEDA manual version 3.0. Technical Report MPI-I93 -106, Max-Planck-Institut fur Informatik, Saarbrucken, Germany, 1993.
Cardinality Matching: Heuristic Search for Augmenting Paths - Möhring, Müller-Hannemann (1995) (1 citation) (Correct)
....anonymous ftp from DIMACS via ftp dimacs. rutgers.edu in directory pub netflow matching . However, we incorporated the efficient starting procedure (KS) of Karp and Sipser into G. 2. an implementation of Tarjan s algorithm [Tar83] referred to as T) written by Stefan Naher in C using LEDA 3. 1 [MN95, Nah95] (available through anonymous ftp from ftp.mpi sb.mpg.de, directory pub LEDA) It uses the heuristic (MP) of Markus Paul. 3. an implementation of the Micali and Vazirani [MV80] algorithm (referred to as MV) written in Pascal by Steven Crocker [Cro93] also available from DIMACS) which we ....
Stefan Naher, LEDA Manuel, Version 3.1, Technical report MPI-I-95-1-002, MaxPlanck -Institut fur Informatik, 1995. 11
A Tool for Graphical Presentation of Software Documents - Allison, Carrington.. (1996) (Correct)
....tool. 3.2 Tool architecture The architecture of the GPM tool is shown in Figure 5. The transceiver provides all communication with the document server, caching structures as required. The graph builder constructs the desired logical graph which is stored in an intermediate data structure ( LEDA [13] libraries are used) to allow incremental construction and updating. 4 Figure 6: UQ diagrammatic display of a call graph This data structure helps preserve existing layouts from one presentation to the next and hence the user s mental map. The drawing tool interface which translates the ....
Stefan Naher. The LEDA user manual. Technical report, Max-Planck-Institut fur Informatik, Saarbrucken, 1995.
Fine-grain partitioning in Codesign - Knudsen (1995) (Correct)
....FULL BRANCH BRANCH CONTROL BRANCH BODY1 PURE BRANCH BODY2 PURE PURE Figure 6.5: BSB hierarchy for the ConGIF graph example. As mentioned, the BSB hierarchy is implemented by the class hierCFGHierarchywhich is constructed on basis of a ConGIF instance. The hierarchy of BSBs is built using a LEDA [24] graph. The constructor of hierCFGHierarchy recursively traverses the ConGIF structure and adds appropriate BSBs (containing links to the ConGIF nodes) to the hierarchy as to reach a result as shown in figure 6.5. 6.3.5 Clustering BSBs for partitioning The BSB hierarchy presented above is not ....
....and memory allocation scheme. Finding the optimal linearization and register allocation for a given dataflow graph is an NP complete problem, so heuristics must be employed. In this release, a very simple approach to linearization has been taken. The dataflow graph is implemented as a LEDA [24] graph in ConGIF. The LEDA C library implements a topological sort algorithm (called TOPSORT) which performs a linearization of a given graph. This routine has been used to linearize the pure dataflow graphs. The employed algorithm is listed in chapter 8 in [24] Mapping to generic ....
[Article contains additional citation context not shown here]
Stefan N aher. LEDA User Manual. Max-Planck-Institut f ur Informatik, Im Stadtwald D6000 Saabr ucken, third edition, 1992.
Progressive TINs: Algorithms and Applications - Maheshwari, Morin, Sack (1997) (10 citations) (Correct)
No context found.
N aher, S. The LEDA manual, Version R-3.4.1. Tech. rep., Max-Planck-Institut fur Informatik, 1996.
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