Suchergebnisse - and systems; G.2.2 [DISCRETE MATHEMATICS]: Graph Theory Graph algorithms

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings von 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 …”
Volltext

Visual Analysis of Large Graphs: State-of-the-Art and Future Research Challenges von von Landesberger, T., Kuijper, A., Schreck, T., Kohlhammer, J., van Wijk, J.J., Fekete, J.-D., Fellner, D.W.

“… How to design appropriate graph analysis systems depends on many factors, including the type of graph describing the data, the analytical task at hand and the applicability of graph analysis methods …”
Volltext

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 …”
Volltext

ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges von Simonetto, Paolo, Archambault, Daniel, Auber, David, Bourqui, Romain

“… PrEd [Ber00] is a force‐directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties …”
Volltext

Quasi-biclique edge concentration: A visual analytics method for biclustering von 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 …”
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 considered an important property by algorithm designers …”
Volltext

Exploring agent-based simulations in political science using Aggregate Temporal Graphs von 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 …”
Volltext

Finding a hamilton path through a family of intervals von Sridhar, M. A., Goyal, S.

“… We develop an o(nx(n)) algorithm for computing a hamilton path in a family of n intervals, where x is an inverse of Ackerman's function …”
Volltext

Parallel algorithms for a multi-level network optimization problem von Cruz, F.R.B., Mateus†, G.R.

“… Multi-level network optimization (MLNO) problems arise in many contexts such as telecommunication, transportation, or electric power systems …”
Volltext