Abstract
We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it exists, must be unique. We prove that it is NP-complete to determine whether a given graph has a strict confluent drawing but polynomial to determine whether it has an outerplanar strict confluent drawing with a fixed vertex ordering (a drawing within a disk, with the vertices placed in a given order on the boundary). © 2013 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Eppstein, D., Holten, D., Löffler, M., Nöllenburg, M., Speckmann, B., & Verbeek, K. (2013). Strict confluent drawing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8242 LNCS, pp. 352–363). Springer Verlag. https://doi.org/10.1007/978-3-319-03841-4_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
