Paper Info
Title
Dagmaps And Epsilon-Visibility Representations Of Dags
Abstract
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 DAG map 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 epsilon-visibility representation. Then we give a characterization of the DAGs that admit directed e-visibility representations. Finally we show that a DAGmap defines a directed three-dimensional e-visibility representation of a DAG.
Year
DOI
Venue
2009
10.1007/978-3-642-11805-0_34
GRAPH DRAWING
Keywords
Field
DocType
DAGmap, Treemap, DAG, Visibility
Discrete mathematics,Visibility,Computer science
Conference
Volume
ISSN
Citations 
5849
0302-9743
0
PageRank 
References 
Authors
0.34
1
2
Name
Order
Citations
PageRank
Vassilis Tsiaras1276.75
Ioannis G. Tollis21240162.75