Cologne Excellence Cluster on Cellular Stress Responses in Aging Associated Diseases
Graph Drawing E-print ArchiveNot a member yet
1225 research outputs found
Sort by
Brain Network Analyzer
No full textBrain Network Analyzer is an application, written in Java, that displays and analyzes synchronization networks from brain signals. The program implements a number of network indices and visualization techniques. The program has been used to analyze networks produced by electroencephalogram data of alcoholic and control patients
Graph Drawing Contest Report
No full textThis report describes the 15th Annual Graph Drawing Contest, held in conjunction with the 2008 Graph Drawing Symposium in Heraklion, Crete, Greece. The purpose of the contest is to monitor and challenge the current state of graph-drawing technology
The Binary Stress Model for Graph Drawing
No full textWe introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models – through the binary stress cost function, which is a carefully defined energy function with low descriptive complexity allowing fast computation via a Barnes-Hut scheme. This allows us to overcome optimization pitfalls from which previous methods suffer. In addition, the binary stress model often offers a unique viewpoint to the graph, which can occasionally add useful insight to its topology. The model uniformly spreads the nodes within a circle. This helps in achieving an efficient utilization of the drawing area. Moreover, the ability to uniformly spread nodes regardless of topology, becomes particularly helpful for graphs with low connectivity, or even with multiple connected components, where there is not enough structure for defining a readable layout
Efficient Node Overlap Removal Using a Proximity Stress Model
No full textWhen drawing graphs whose nodes contain text or graphics, the nontrivial node sizes must be taken into account, either as part of the initial layout or as a post-processing step. The core problem is to avoid overlaps while retaining the structural information inherent in a layout using little additional area. This paper presents a new node overlap removal algorithm that does well by these measures
Graph Drawing for Security Visualization
No full textWith the number of devices connected to the internet growing rapidly and software systems being increasingly deployed on the web, security and privacy have become crucial properties for networks and applications. Due the complexity and subtlety of cryptographic methods and protocols, software architects and developers often fail to incorporate security principles in their designs and implementations. Also, most users have minimal understanding of security threats. While several tools for developers, system administrators and security analysts are available, these tools typically provide information in the form of textual logs or tables, which are cumbersome to analyze. Thus, in recent years, the field of security visualization has emerged to provide novel ways to display security-related information so that it is easier to understand. In this work, we give a preliminary survey of approaches to the visualization of computer security concepts that use graph drawing techniques
Crossing and Weighted Crossing Number of Near-Planar Graphs
No full textA nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from different combinatorial viewpoints. On the one hand, we develop min-max formulas involving efficiently computable lower and upper bounds. These min-max results are the first of their kind in the study of crossing numbers and improve the approximation factor for the approximation algorithm given by Hlinˇny e´ and Salazar (Graph Drawing GD 2006). On the other hand, we show that it is NP-hard to compute a weighted version of the crossing number
for near-planar graphs
Topological Morphing of Planar Graphs
No full textIn this paper we study how two planar embeddings of the same biconnected graph can be morphed one into the other while minimizing the number of elementary changes