Suchergebnisse - "G.2.2 [Discrete Mathematics]: Graph Theory- Graph algorithms"

The Readability of Path-Preserving Clusterings of Graphs von Archambault, Daniel, Purchase, Helen C., Pinaud, Bruno

“… Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in …”
Volltext

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings von Didimo, Walter, Kornaropoulos, Evgenios M., Montecchiani, Fabrizio, Tollis, Ioannis G.

“… Overloaded orthogonal drawing (OOD) is a recent graph visualization style specifically conceived for directed graphs. It merges the advantages of some popular …”
Volltext

Quasi-biclique edge concentration: A visual analytics method for biclustering von Onoue, Yosuke, Koyamada, Koji

“… Biclustering is a well-known approach for data mining, and it is applied in many fields, such as genome analyses, security services, and social network …”
Volltext

Exploring agent-based simulations in political science using Aggregate Temporal Graphs von Crouser, R. Jordan, Freeman, Jeremy G., Winslow, Andrew, Chang, Remco

“… Agent-based simulation has become a key technique for modeling and simulating dynamic, complicated behaviors in social and behavioral sciences. As these …”
Volltext

The mental map and memorability in dynamic graphs von Archambault, D., Purchase, H. C.

“… In dynamic graph drawing, preserving the mental map, or ensuring that the location of nodes do not change significantly as the information evolves over time is …”
Volltext

Extending the spring-electrical model to overcome warping effects von Yifan Hu, Koren, Y.

“… The spring-electrical model based force directed algorithm is widely used for drawing undirected graphs, and sophisticated implementations can be very …”
Volltext

A visual canonical adjacency matrix for graphs von Hongli Li, Grinstein, G., Costello, L.

“… Graph data mining algorithms rely on graph canonical forms to compare different graph structures. These canonical form definitions depend on node and edge …”
Volltext

On the use of graph search techniques for the analysis of extreme-scale combustion simulation data von McLendon, W. C., Bansal, G., Bremer, P.-T, Chen, J., Kolla, H., Bennett, J. C.

“… With the continuous increase in high performance computing capabilities, simulations are becoming ever larger and more complex, using bigger domains, tracking …”
Volltext