PlaNet - A Software Package of Algorithms and Heuristics on Planar Networks (ResearchIndex)

PlaNet A Software Package of Algorithms and Heuristics on Planar Networks (1997) (Make Corrections)
Ulrik Brandes, Gabriele Neyer, Wolfram Schlickenrieder, Dorothea Wagner, Karsten Weihe

Home/Search Context Related

View or download:
fmi.unikonstanz.de/~weih...planet.ps.Z
ifor.math.ethz.ch/~sc...newplanet.ps.gz
Cached:  PS.gz  PS  PDF  DjVu  Image  Update  Help

From:  fmi.unikonstanz.de/~brandes/ (more)
Homepages:  U.Brandes  G.Neyer
  D.Wagner  [2]  [3]  [4]  K.Weihe
  HPSearch  (Update Links)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: We present a package for algorithms on planar networks. This package comes with a graphical user interface, which may be used for demonstrating and animating algorithms. Our focus so far has been on disjoint path problems. However, the package is intended to serve as a general framework, wherein algorithms for various problems on planar networks may be integrated and visualized. For this aim, the structure of the package is designed so that integration of new algorithms and even new algorithmic ... (Update)

Similar documents (at the sentence level):
37.0%: Edge-Disjoint Paths in Planar Graphs with Short Total Length - Brandes, Neyer, Wagner (1996) (Correct)
16.8%: PlaNet Tutorial and Reference Manual - Handke, Neyer (1996) (Correct)

Active bibliography (related documents): More All
1.6: VLSI Network Design - Möhring, Wagner, Wagner (1992) (Correct)
1.0: Simple Algorithms for Steiner Trees and Paths Packing Problems in .. - Wagner (1993) (Correct)
0.7: A Linear Time Algorithm for the Arc Disjoint Menger Problem.. - Brandes, Wagner (1997) (Correct)

Similar documents based on text: More All
0.3: Jahresbericht 1994 bis 1996 Informatik - Universität Konstanz - Scholl, (eds.) (1994) (Correct)
0.3: Empirical Design of Geometric Algorithms - Weihe, Brandes, Liebers.. (1999) (Correct)
0.3: Fast Layout Methods for Timetable Graphs - Brandes, Shubina, Tamassia, Wagner (2000) (Correct)

BibTeX entry: (Update)

@misc{ brandes-planet,
  author = "Ulrik Brandes and Gabriele Neyer and Wolfram Schlickenrieder and Dorothea
    Wagner and Karsten Weihe",
  title = "{PlaNet} --- A Software Package of Algorithms and Heuristics on Planar Networks",
  url = "citeseer.nj.nec.com/brandes97planet.html" }

Citations (may not include all citations):
3445 Computers and Intractability: A Guide to the Theory of NP--C.. (context) - Garey, Johnson - 1979
1114 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1993
1054 Object--oriented software construction (context) - Meyer - 1994
429 Algorithms in combinatorial geometry (context) - Edelsbrunner - 1987
223 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
103 A linear-time algorithm for a special case of disjoint set u.. (context) - Gabow, Tarjan - 1985
39 Multicommodity flows in planar graphs (context) - Okamura, Seymour - 1981
22 The LEDA user manual (context) - Mehlhorn, Naher et al. - 1996
14 A linear time algorithm for edge-disjoint paths in planar gr.. (context) - Wagner, Weihe - 1993
14 A linear time algorithm for edge-disjoint paths in planar gr.. (context) - Wagner, Weihe - 1995
13 Addison-- Wesley Publishing Company (context) - Stroustrup, programming et al. - 1991
8 The vertexdisjoint Menger-problem in planar graphs - Ripphausen-Lipa, Wagner et al. - 1993
6 Optimal routing through dense channels (context) - Wagner - 1993
6 Algorithms for routing in planar graphs (context) - Becker, Mehlhorn - 1986
6 Routing through a dense channel with minimum total wire leng.. (context) - Formann, Wagner et al. - 1993
5 LEDA: a library of efficient data structures and algorithms (context) - Mehlhorn, Naher - 1995
5 Efficient algorithms for disjoint paths in planar graphs (context) - Ripphausen-Lipa, Wagner et al. - 1995
5 Addison--Wesley Publishing Company (context) - Gamma, Helm et al. - 1995
4 An efficient algorithm for finding multicommodity flows in p.. (context) - Matsumoto, Nishizeki et al. - 1985
4 paths in undirected planar graphs in linear time (context) - Weihe, -- - 1994
4 A faster algorithm for edge-disjoint paths in planar graphs (context) - Kaufmann, Klar - 1991
3 Short wire routing in convex grids (context) - Wagner, Wolfers - 1991
2 An animated library for combinatorial VLSI routing algorithm.. - Wagner, Weihe - 1993
2 Optimierung von Wegpackungen in planaren Graphen (context) - Neyer - 1996
2 Master thesis (context) - Oellrich - 1996
1 PlaNet tutorial and reference manual - Handke, Neyer - 1996
1 An animated library for combinatorial VLSI routing (context) - Wagner, Weihe - 1995

Documents on the same site (http://www.fmi.uni-konstanz.de/~brandes/): More
A Bayesian Paradigma for Dynamic Graph Layout - Ulrik Brandes, Dorothea Wagner (1997) (Correct)
Random Field Models for Graph Layout - Brandes, Wagner (1997) (Correct)
A Linear Time Algorithm for the Arc Disjoint Menger Problem.. - Brandes, Wagner (1997) (Correct)

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