Name
Abstract | ||
|---|---|---|
In this paper we present algorithms for drawing series parallel digraphs with as much symmetry as possible. The first step is to compute a certain kind of automorphism, called an "upward planar automorphism" for an input series parallel digraph. The next step uses these automorphisms to construct a symmetric drawing of the graph. We present several variations of the second step, with visibility drawings, "bus-orthogonal" drawings, and polyline drawings. All algorithms run in linear time. (C) 2000 Elsevier Science B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0925-7721(00)00020-1 | Comput. Geom. |
Keywords | Field | DocType |
digraphs symmetrically,series parallel,linear time | Discrete mathematics,Graph,Visibility,Combinatorics,Automorphism,Planar,Series and parallel circuits,Time complexity,Mathematics,Digraph | Journal |
Volume | Issue | ISSN |
17 | 3-4 | 0925-7721 |
Citations | PageRank | References |
16 | 1.08 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Seok-Hee Hong | 1 | 1057 | 91.85 |
| Peter Eades | 2 | 962 | 69.36 |
| Sang-Ho Lee | 3 | 28 | 4.50 |