Search Results - G.2.2 [Discrete Mathematics]: Graph Theory-Graph Algorithms

The Readability of Path-Preserving Clusterings of Graphs by 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…”
Get full text

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

“… Biclustering finds bicliques contained in a bipartite graph. However, in real data, a biclique may lack several edges because of various reasons, such as errors…”
Get full text

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

“… Besides the algorithm for acyclic digraphs, the DAGView framework implements extensions to visualize both digraphs with cycles and undirected graphs, with the additional possibility of taking…”
Get full text

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

“… In this paper, we introduce the Aggregate Temporal Graph (ATG), a graph formulation that can be used to capture complex relationships between discrete simulation states in time…”
Get full text

The mental map and memorability in dynamic graphs by 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 considered an important property by algorithm designers…”
Get full text

Extending the spring-electrical model to overcome warping effects by 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 efficient for visualizing large graphs…”
Get full text

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

“…Graph data mining algorithms rely on graph canonical forms to compare different graph structures…”
Get full text

On the use of graph search techniques for the analysis of extreme-scale combustion simulation data by 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…”
Get full text

Exact values for three domination-like problems in circular and infinite grid graphs of small height by Bouznif, Marwane, Darlay, Julien, Moncel, Julien, Preissmann, Myriam

“… We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of given height…”
Get full text