Results 1  10
of
267
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 515 (40 self)
 Add to MetaCart
Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows: ffl We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. ffl We present several efficient dynamic drawing algorithms for trees, seriesparallel digraphs, planar stdigraphs, and planar graphs. These algorithms adopt a variety of representations (e.g., straightline, polyline, visibility), and update the drawing in a smooth way.
An algorithm for drawing general undirected graphs
 Information Processing Letters
, 1989
"... Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, dataflow graphs, Petri nets, and entit ..."
Abstract

Cited by 455 (2 self)
 Add to MetaCart
Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, dataflow graphs, Petri nets, and entityrelationship diagrams, basic graph drawing algorithms are required.
Graph Visualization and Navigation in Information Visualization: a Survey
 IEEE Transactions on Visualization and Computer Graphics
, 2000
"... This is a survey on graph visualization and navigation techniques, as used in information visualization. Graphs appear in numerous applications such as web browsing, statetransition diagrams, and data structures. The ability to visualize and to navigate in these potentially large, abstract graphs ..."
Abstract

Cited by 319 (3 self)
 Add to MetaCart
This is a survey on graph visualization and navigation techniques, as used in information visualization. Graphs appear in numerous applications such as web browsing, statetransition diagrams, and data structures. The ability to visualize and to navigate in these potentially large, abstract graphs is often a crucial part of an application. Information visualization has specific requirements, which means that this survey approaches the results of traditional graph drawing from a different perspective. Index TermsInformation visualization, graph visualization, graph drawing, navigation, focus+context, fisheye, clustering. 1
An open graph visualization system and its applications to software engineering
 SOFTWARE  PRACTICE AND EXPERIENCE
, 2000
"... We describe a package of practical tools and libraries for manipulating graphs and their drawings. Our design, which aimed at facilitating the combination of the package components with other tools, includes stream and event interfaces for graph operations, highquality static and dynamic layout alg ..."
Abstract

Cited by 308 (9 self)
 Add to MetaCart
We describe a package of practical tools and libraries for manipulating graphs and their drawings. Our design, which aimed at facilitating the combination of the package components with other tools, includes stream and event interfaces for graph operations, highquality static and dynamic layout algorithms, and the ability to handle sizable graphs. We conclude with a description of the applications of this package to a variety of software engineering tools.
A Technique for Drawing Directed Graphs
 IEEE Transactions on Software Engineering
, 1993
"... We describe a fourpass algorithm for drawing directed graphs. The first pass finds an optimal rank assignment using a network simplex algorithm. The second pass sets the vertex order within ranks by an iterative heuristic incorporating a novel weight function and local transpositions to reduce cros ..."
Abstract

Cited by 220 (19 self)
 Add to MetaCart
We describe a fourpass algorithm for drawing directed graphs. The first pass finds an optimal rank assignment using a network simplex algorithm. The second pass sets the vertex order within ranks by an iterative heuristic incorporating a novel weight function and local transpositions to reduce crossings. The third pass finds optimal coordinates for nodes by constructing and ranking an auxiliary graph. The fourth pass makes splines to draw edges. The algorithm makes good drawings and runs fast. 1.
GRASP and path relinking for 2layer straight line crossing minimization
 INFORMS Journal on Computing
, 1999
"... ABSTRACT — In this paper, we develop a greedy randomized adaptive search procedure (GRASP) for the problem of minimizing straightline crossings in a 2layer graph. The procedure is fast and is particularly appealing when dealing with lowdensity graphs. When a modest increase in computational time ..."
Abstract

Cited by 86 (15 self)
 Add to MetaCart
ABSTRACT — In this paper, we develop a greedy randomized adaptive search procedure (GRASP) for the problem of minimizing straightline crossings in a 2layer graph. The procedure is fast and is particularly appealing when dealing with lowdensity graphs. When a modest increase in computational time is allowed, the procedure may be coupled with a path relinking strategy to search for improved outcomes. Although the principles of path relinking have appeared in the tabu search literature, this search strategy has not been fully implemented and tested. We perform extensive computational experiments with more than 3,000 graph instances to first study the effect of changes in critical search parameters and then to compare the efficiency of alternative solution procedures. Our results indicate that graph density is a major influential factor on the performance of a solution procedure. Laguna and Martí / 2 The problem of minimizing straightline crossings in layered graphs has been the subject of study for at least 17 years, beginning with the Relative Degree Algorithm introduced by Carpano [2]. The problem consists of aligning the two shores V1 and V2 of a bipartite graph G = (V1, V2, E) on two parallel straight lines (layers) such that the number of crossing between the edges in E is minimized
On the Inference of Configuration Structures from Source Code
 In Proceedings of the 16th International Conference on Software Engineering
, 1994
"... We apply mathematical concept analysis to the problem of infering configuration structures from existing source code. Concept analysis has been developed by German mathematicians over the last years; it can be seen as a discrete analogon to Fourier analysis. Based on this theory, our tool will accep ..."
Abstract

Cited by 79 (5 self)
 Add to MetaCart
We apply mathematical concept analysis to the problem of infering configuration structures from existing source code. Concept analysis has been developed by German mathematicians over the last years; it can be seen as a discrete analogon to Fourier analysis. Based on this theory, our tool will accept source code, where configurationspecific statements are controlled by the preprocessor. The algorithm will compute a socalled concept lattice, which  when visually displayed  allows remarkable insight into the structure and properties of possible configurations. The lattice not only displays finegrained dependencies between configuration threads, but also visualizes the overall quality of configuration structures according to software engineering principles. The paper presents a short introduction to concept analysis, as well as experimental results on various programs. 1 Introduction A simple and widely used technique for configuration management is the use of the C preprocessor. ...
2Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
, 1997
"... We present algorithms for the two layer straightline crossing minimization problem that are able to compute exact optima. Our computational results lead us to the conclusion that there is no need for heuristics if one layer is fixed, even though the problem is NPhard, and that for the general probl ..."
Abstract

Cited by 64 (6 self)
 Add to MetaCart
We present algorithms for the two layer straightline crossing minimization problem that are able to compute exact optima. Our computational results lead us to the conclusion that there is no need for heuristics if one layer is fixed, even though the problem is NPhard, and that for the general problem with two variable layers, true optima can be computed for sparse instances in which the smaller layer contains up to 15 nodes. For bigger instances, the iterated barycenter method turns out to be the method of choice among several popular heuristics whose performance we could assess by comparing their results to optimum solutions.