
doi: 10.7155/jgaa.00097
Summary: The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality. We introduce connection sets stressing relationships between several subgraphs. In a case study, we demonstrate how they can be used to visualize connections between many small network motifs. This paper is based on a submission to the Graph Drawing Contest 2003 Drawing Graphs within Graphs [\url{http://www.infosun.fmi.uni-passau.de/br/lehrstuhl/GraphDrawing/GD2003/contest.html}]. The intent of the contest was to encourage research concerned with layouts of subgraphs.
Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Graph representations (geometric and intersection representations, etc.)
Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Graph representations (geometric and intersection representations, etc.)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
