Suchergebnisse - G.2.2.a Graph algorithms

Exact values for three domination-like problems in circular and infinite grid graphs of small height von 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 …”
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

Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques von van Den Brand, Jan, Zhang, Daniel J.

“… This differs from the single commodity problem (e.g. maximum flow) where all recent improvements also rely on graph specific techniques such as graph decompositions or the Laplacian paradigm …”
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

Managing Chaos: Bridging the cultural divide between engineers and scientists working within the life sciences von Killcoyne, Sarah, Boyle, John

“… Within the rather chaotic atmosphere of scientific research the adoption of a software process, and the structured development of software, can be out of …”
Volltext

Introducing: The Libflame Library for Dense Matrix Computations von Van Zee, Field, Chan, Ernie, van de Geijn, Robert, Quintana, Enrique, Quintana-Orti, Gregorio

“… As part of the FLAME project, we have been dilligently developing new methodologies for analyzing, designing, and implementing linear algebra libraries. While …”
Volltext

Evaluating the ecological suitability for Olive tree in Sichuan using GIS and comprehensive fuzzy method: Methodological development and application von Guo, Xiang, Yan, Dong, Fan, Jianrong, Zhu, Wanze, Li, Mai-He

“… We have used the Geographic Information System’s (GIS) spatial analysis functions and comprehensive fuzzy sets to evaluate and analyze the ecological …”
Volltext

The quantification of mountains in China Based on Geographic Information System von Jiang, Xiaobo, Ji, Wei, Zeng, Hongcheng, Chen, Leiting

“… Two criteria are chosen to determine the boundaries of mountains in China. One is the domestic criterion (DC) in China; the other is an international criterion …”
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

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

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

TugGraph: Path-preserving hierarchies for browsing proximity and paths in graphs von Archambault, D., Munzner, T., Auber, D.

“… Many graph visualization systems use graph hierarchies to organize a large input graph into logical components …”
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 efficient for visualizing large graphs …”
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 …”
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

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs von Balzotti, Lorenzo

“… Even if path graphs and directed path graphs are characterized very similarly, their recognition algorithms differ widely …”
Volltext

Maximum Entropy Summary Trees von Karloff, Howard, Shirley, Kenneth E.

“… ‐programming algorithm to compute this maximum entropy summary tree …”
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.

“… The analysis of large graphs plays a prominent role in various fields of research and is relevant in many important application areas …”
Volltext

On the generation of binary trees from (0-1) codes von Ahrabian, H., Nowzari-Dalini, A.

“… An efficient recursive a algorithm for the generating all shapes of binary trees with n-nodes is presented …”
Volltext

An explicit construction of graphs of bounded degree that are far from being Hamiltonian von Adler, Isolde, Köhler, Noleen

“… Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonian cycles, and to related questions …”
Volltext