PlaNet Tutorial and Reference Manual (1996)  (Make Corrections)  (1 citation)
Dagmar Handke, Gabriele Neyer

  Home/Search   Context   Related
 
View or download:
fmi.unikonstanz.de...preprint018.ps.Z
inf.unikonstanz.de...preprint018.ps.Z
Cached:  PS.gz  PS  PDF  DjVu  Image  Update  Help

From:  fmi.unikonstanz....projekte_algo (more)
Homepages:  D.Handke  G.Neyer
  HPSearch  (Update Links)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper, and to add own new classes and algorithms. There are only three conditions that have to be fulfilled: ffl For each algorithm of a problem class P that is to be integrated into PlaNet, P has to be integrated in PlaNet. (Update)

Context of citations to this paper:   More

...with each other. The GUI offers a feature to print the contents of a window or to dump it to a file in PostScript format. We refer to [HN96] for a tutorial, a more detailed overview, and a reference manual. 3 From a Developer s Perspective The implementation heavily...

Cited by:   More
PlaNet - A Software Package of Algorithms and.. - Brandes, Neyer.. (1997)   (Correct)

Active bibliography (related documents):   More   All
1.0:   A Linear Time Algorithm for the Arc Disjoint Menger Problem.. - Brandes, Wagner (1997)   (Correct)
0.6:   Edge-Disjoint Paths in Planar Graphs with Short Total Length - Brandes, Neyer, Wagner (1996)   (Correct)
0.6:   Simple Algorithms for Steiner Trees and Paths Packing Problems in .. - Wagner (1993)   (Correct)

Similar documents based on text:   More   All
1.2:   Survivable Networks with Bounded Delay - Cicerone, Di Stefano, Handke (1999)   (Correct)
1.2:   Jahresbericht 1994 bis 1996 Informatik - Universität Konstanz - Scholl, (eds.) (1994)   (Correct)
1.0:   Independent Tree Spanners - Fault-Tolerant Spanning Trees with.. - Handke (1998)   (Correct)

Related documents from co-citation:   More   All
2:   A linear time algorithm for edge-disjoint paths in planar graphs (context) - Wagner, Weihe - 1993

BibTeX entry:   (Update)

Dagmar Handke and Gabriele Neyer. PlaNet tutorial and reference manual, 1996. http://citeseer.nj.nec.com/handke96planet.html   More

@misc{ handke96planet,
  author = "D. Handke and G. Neyer",
  title = "PlaNet tutorial and reference manual",
  text = "Dagmar Handke and Gabriele Neyer. PlaNet tutorial and reference manual,
    1996.",
  year = "1996",
  url = "citeseer.nj.nec.com/handke96planet.html" }
Citations (may not include all citations):
2929   Introduction to algorithms (context) - Cormen, Leiserson et al. - 1994    
1039   Object--oriented software construction (context) - Meyer - 1994    
417   Algorithms in combinatorial geometry (context) - Edelsbrunner - 1987
219   Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
16   Managing projects with make (context) - Oram, Talbott - 1993
14   A linear time algorithm for edge-disjoint paths in planar gr.. (context) - Wagner, Weihe - 1995
14   A linear time algorithm for edge-disjoint paths in planar gr.. (context) - Wagner, Weihe - 1993
13   Addison--Wesley Publishing Company (context) - Stroustrup, programming et al. - 1991
8   The vertex-disjoint menger problem in planar graphs - Ripphausen-Lipa, Wagner et al. - 1997
8   The vertex-disjoint Menger-problem in planar graphs - Ripphausen-Lipa, Wagner et al. - 1993
5   Efficient algorithms for disjoint paths in planar graphs (context) - Ripphausen-Lipa, Wagner et al. - 1995
5   volume 32 of Annals of Discrete Mathematics (context) - Nishizeki, Chiba et al. - 1988
5   LEDA: a library of efficient data structures and algorithms (context) - Mehlhorn, Naher - 1995
4   paths in undirected planar graphs in linear time (context) - Weihe, -- - 1994
4   paths in undirected planar graphs in linear time (context) - Weihe, -- - 1997
3   Addison--Wesley Publishing Company (context) - Harary - 1969
2   PlaNet --- A demonstration package for algorithms on planar .. (context) - Neyer, Schlickenrieder et al. - 1996
2   Optimierung von Wegpackungen in planaren Graphen (context) - Neyer - 1996
1   Edge-disjoint paths in planar graphs with short total length - Brandes, Neyer et al. - 1996
1   ADLIBS --- An advanced data structure library for project sc.. (context) - Kuhl, Ludwig et al. - 1993

Documents on the same site (http://www.fmi.uni-konstanz.de/Forschung/projekte_algo.html):
Independent Tree Spanners - Fault-Tolerant Spanning Trees with.. - Handke (1998)   (Correct)
Wiring Edge-Disjoint Layouts - Kuchem, Wagner (1996)   (Correct)

Online articles have much greater impact   More about CiteSeer   Add search form to your site   Submit documents   Feedback  

CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute