2011
DOI: 10.1109/tvcg.2010.60
|View full text |Cite
|
Sign up to set email alerts
|

Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths

Abstract: Abstract-Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place these features inside levels of a hierarchy. However, this feature detection is a global process and does not consider nodes of the graph near a feature of interest. TugGraph is a system for exploring paths and proximity around nodes and subgraphs in a graph. The approach modifies a pre-existing hierarchy in order to see how a n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0
2

Year Published

2014
2014
2024
2024

Publication Types

Select...
5
2
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(23 citation statements)
references
References 26 publications
0
21
0
2
Order By: Relevance
“…The approach, however, does not represent cellular components. Other approaches that group nodes in two-dimensional space have been proposed, such as constrained force-directed layout [13], constrained projections [14], hierarchical graph placement [15,16,17] and others [18,19,20,21]. Despite their good performance even for large networks, the cell structure is not taken into consideration in either of those cases.…”
Section: Introductionmentioning
confidence: 99%
“…The approach, however, does not represent cellular components. Other approaches that group nodes in two-dimensional space have been proposed, such as constrained force-directed layout [13], constrained projections [14], hierarchical graph placement [15,16,17] and others [18,19,20,21]. Despite their good performance even for large networks, the cell structure is not taken into consideration in either of those cases.…”
Section: Introductionmentioning
confidence: 99%
“…Muelder and Ma [44] adopted treemaps to hierarchically organize graphs, so that they can be efficiently mapped onto 2D layouts. GrouseFlocks and TugGraph [4,5,6] support interactions to add and remove aggregated nodes on demand, which provides users with more flexibility to organize node clusters. Vehlow et al [48] represented communities as abstract nodes and highlighted nodes between communities through partially aggregated graphs.…”
Section: Related Work 21 Node-link Diagramsmentioning
confidence: 99%
“…An approach to visualize the evolution of groups for dynamic graphs is to draw groups as rectangles on top of a flow‐like group evolution visualization; between‐group edges are aggregated and the subgraphs of individual groups are drawn within the group representations [VBAW15] . Disjoint hierarchical groups can be visualized using nested rectangular [ASH14, DM12, DM14a, RPD09] or circular [AMA07a, AMA08, AMA09, AMA11] (3D: spherical [vHvW04]) group structure representations (Figure a.2). Reitz et al .…”
Section: Taxonomy Of Vertex Group Structure Visualizationsmentioning
confidence: 99%