Výsledky vyhľadávania - "G.2.2 [Discrete Mathematics]: Graph Theory-Graph Algorithms"

The Readability of Path-Preserving Clusterings of Graphs Autor 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…”
Získať plný text

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings Autor 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…”
Získať plný text

Quasi-biclique edge concentration: A visual analytics method for biclustering Autor 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…”
Získať plný text

Exploring agent-based simulations in political science using Aggregate Temporal Graphs Autor 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…”
Získať plný text

The mental map and memorability in dynamic graphs Autor 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…”
Získať plný text

Extending the spring-electrical model to overcome warping effects Autor 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…”
Získať plný text

A visual canonical adjacency matrix for graphs Autor 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…”
Získať plný text

On the use of graph search techniques for the analysis of extreme-scale combustion simulation data Autor 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…”
Získať plný text