Name
Abstract | ||
|---|---|---|
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence of a planar L-drawing is an NP-complete problem. Motivated by this result, we focus on upward-planar L-drawings. We show that directed st-graphs admitting an upward- (resp. upward-rightward-) planar L-drawing are exactly those admitting a bitonic (resp. monotonically increasing) st-ordering. We give a linear-time algorithm that computes a bitonic (resp. monotonically increasing) st-ordering of a planar st-graph or reports that there exists none. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-73915-1_36 | graph drawing |
DocType | Volume | Citations |
Conference | abs/1708.09107 | 3 |
PageRank | References | Authors |
0.38 | 13 | 8 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| steven chaplick | 1 | 76 | 16.91 |
| Markus Chimani | 2 | 301 | 35.55 |
| Sabine Cornelsen | 3 | 144 | 19.85 |
| Giordano Da Lozzo | 4 | 87 | 23.65 |
| Martin Nöllenburg | 5 | 114 | 23.79 |
| Maurizio Patrignani | 6 | 675 | 61.47 |
| Ioannis G. Tollis | 7 | 1240 | 162.75 |
| Alexander Wolff | 8 | 43 | 6.65 |