DAGmaps are space filling visualizations of DAGs that generalize treemaps. Deciding whether or not a DAG admits a DAGmap is NP-complete. Recently we defined a special case called one-dimensional DAGmap where the admissibility is decided in linear time. However there is no complete characterization of the class of DAGs that admit a one-dimensional DAGmap. In this paper we prove that a DAG admits a one-dimensional DAGmap if and only if it admits a directed ε-visibility representation. Then we give a characterization of the DAGs that admit directed ε-visibility representations. Finally we show that a DAGmap defines a directed three-dimensional ε-visibility representation of a DAG. © 2010 Springer-Verlag.
CITATION STYLE
Tsiaras, V., & Tollis, I. G. (2010). DAGmaps and ε-visibility representations of DAGs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5849 LNCS, pp. 357–368). https://doi.org/10.1007/978-3-642-11805-0_34
Mendeley helps you to discover research relevant for your work.