Results 1  10
of
13
An Experimental Comparison of ForceDirected and Randomized Graph Drawing Algorithms
, 1996
"... . We report on our experiments with five graph drawing algorithms for general undirected graphs. These are the algorithms FR introduced by Fruchterman and Reingold [5], KK by Kamada and Kawai [11], DH by Davidson and Harel [1], Tu by Tunkelang [13] and GEM by Frick, Ludwig and Mehldau [6]. Implement ..."
Abstract

Cited by 44 (1 self)
 Add to MetaCart
. We report on our experiments with five graph drawing algorithms for general undirected graphs. These are the algorithms FR introduced by Fruchterman and Reingold [5], KK by Kamada and Kawai [11], DH by Davidson and Harel [1], Tu by Tunkelang [13] and GEM by Frick, Ludwig and Mehldau [6]. Implementations of these algorithms have been integrated into our GraphEd system [9]. We have tested these algorithms on a wide collection of examples and with different settings of parameters. Our examples are from original papers and by our own. The obtained drawings are evaluated both empirically and by GraphEd's evaluation toolkit. As a conclusion we can confirm the reported good behaviour of the algorithms. Combining time and quality we recommend to use GEM or KK first, then FR and Tu and finally DH. 1 Introduction Graph drawing has become an important area of research in Computer Science. There is a wide range of applications including data structures, data bases, software engineering, VLSI te...
Issues in the Practical Use of Graph Rewriting
 5th Workshop on Graph Grammars and Their Application To Computer Science, Lecture Notes in Computer Science
, 1996
"... Graphs are a popular data structure, and graphmanipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graphrewriting notation. However, when a software developer is persuaded to try graph rewriting, several problems commonly arise. Primar ..."
Abstract

Cited by 36 (1 self)
 Add to MetaCart
Graphs are a popular data structure, and graphmanipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graphrewriting notation. However, when a software developer is persuaded to try graph rewriting, several problems commonly arise. Primarily, it is difficult for a newcomer to develop a feel for how computations are expressed via graph rewriting. Also, graphrewriting is not convenient for solving all aspects of a problem: better mechanisms are needed for interfacing graph rewriting with other styles of computation.
Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools
 ALGORITHMICA
, 1996
"... ..."
GraphEd: A Graphical Platform for the Implementation of Graph Algorithms (Extended Abstract and Demo)
 Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science
"... and Demo) Michael Himsolt Universitat Passau, 94032 Passau, GERMANY himsolt@fmi.unipassau.de Abstract. GraphEd is an extensible graph editor. Its powerful object oriented user interface supports all operations that are necessary for the convenient construction and manipulation of graphs. Graph gr ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
and Demo) Michael Himsolt Universitat Passau, 94032 Passau, GERMANY himsolt@fmi.unipassau.de Abstract. GraphEd is an extensible graph editor. Its powerful object oriented user interface supports all operations that are necessary for the convenient construction and manipulation of graphs. Graph grammars can be used as a macro system to create structured graphs. GraphEd's modular structure and the application interface support the easy integration of algorithm modules which are written in C, or can run external programs. The user may construct graphs interactively, select algorithms from a menu, and view the results of an algorithm directly on screen. Several graph layout algorithms assist the user to tidy graph drawings, and help the programmer to visualize results or debug complex algorithms. Actual applications range from standard graph algorithms over graph drawing algorithms, algorithm animation and combinatorial algorithms to front ends for circuit design systems. 1 Introduction...
A Polyhedral Approach to Planar Augmentation and Related Problems
, 1995
"... . Given a planar graph G, the planar (biconnectivity) augmentation problem is to add the minimum number of edges to G such that the resulting graph is still planar and biconnected. Given a nonplanar and biconnected graph, the maximum planar biconnected subgraph problem consists of removing the minim ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
. Given a planar graph G, the planar (biconnectivity) augmentation problem is to add the minimum number of edges to G such that the resulting graph is still planar and biconnected. Given a nonplanar and biconnected graph, the maximum planar biconnected subgraph problem consists of removing the minimum number of edges so that planarity is achieved and biconnectivity is maintained. Both problems are important in Automatic Graph Drawing. In [JM95], the minimum planarizing k augmentation problem has been introduced, that links the planarization step and the augmentation step together. Here, we are given a graph which is not necessarily planar and not necessarily kconnected, and we want to delete some set of edges D and to add some set of edges A such that jDj + jAj is minimized and the resulting graph is planar, kconnected and spanning. For all three problems, we have given a polyhedral formulation by defining three different linear objective functions over the same polytope, namely ...
Comparing and Evaluating Layout Algorithms within GraphEd
 J. Visual Languages and Computing
, 1995
"... This paper is organized as follows. In section 2, we present an overview on the GraphEd system and the implemented graph drawing algorithms. Section 3 explains our evaluation experiments, and Section 4 shows our results. In Section 5 we give a subjective ranking of layout criteria. 2 GraphEd ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
This paper is organized as follows. In section 2, we present an overview on the GraphEd system and the implemented graph drawing algorithms. Section 3 explains our evaluation experiments, and Section 4 shows our results. In Section 5 we give a subjective ranking of layout criteria. 2 GraphEd
HGV: A Library for Hierarchies, Graphs, and Views
 American Chemical Society
, 2002
"... We introduce the base architecture of a software library which combines graphs, hierarchies, and views and describes the interactions between them. Each graph may have arbitrarily many hierarchies and each hierarchy may have arbitrarily many views. Both the hierarchies and the views can be added ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We introduce the base architecture of a software library which combines graphs, hierarchies, and views and describes the interactions between them. Each graph may have arbitrarily many hierarchies and each hierarchy may have arbitrarily many views. Both the hierarchies and the views can be added and removed dynamically from the corresponding graph and hierarchy, respectively. The software library shall serve as a platform for algorithms and data structures on hierarchically structured graphs. Such graphs become increasingly important and occur in special applications, e. g., call graphs in software engineering or biochemical pathways, with a particular need to manipulate and draw graphs.
A View to Graph Drawing Algorithms through GraphEd
 In: Proceedings of the International Workshop on Graph Drawing `93. Svres
, 1997
"... We compare a collection of graph drawing algorithms implemented in our Graph Ed system. We report on our experience from running these algorithms on a large number of examples both from the literature and by our own, and present our evaluation of the practical relevance of the algorithms and layout ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We compare a collection of graph drawing algorithms implemented in our Graph Ed system. We report on our experience from running these algorithms on a large number of examples both from the literature and by our own, and present our evaluation of the practical relevance of the algorithms and layout criteria. The representation of complex structures as graphs is widespread. Graph drawing has gained increasing importance in many areas of Computer Science, but has proved to be a difficult task. Our Graph Ed system is an approach to support solutions to this problem. Graph Ed has been used by practitioners for database design, Petri nets and electrical circuits. One of its major applications is the implementation and evaluation of graph layout algorithms. With its capabilities to create and edit graphs, Graph Ed provides an effective environment to create and test large sets of examples. Since all drawing algorithms are built into one tool, it is easy to compare the effect of differ...
Implementing Hierarchical GraphStructures
 Proc. Formal Aspects of Software Engineering (FASE'99), number 1577 in Lecture Notes in Computer Science
, 1999
"... . We present concepts for the implementation of hierarchical graphs, which can be used as basis for the implementation of tools for graphical formal description techniques (gFDT) like SDL or statecharts. Our approach provides a strong modularity of a specification by a loose coupling between dif ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
. We present concepts for the implementation of hierarchical graphs, which can be used as basis for the implementation of tools for graphical formal description techniques (gFDT) like SDL or statecharts. Our approach provides a strong modularity of a specification by a loose coupling between different hierarchy levels and it serves for a rapid development of interactive editors for gFDTs by a special technique of describing hierarchy. Furthermore, this technique allows the reuse of graph editors in different applications. Our concepts are explained by means of the graphical design tool Moby/plc for a special class of realtime automata, called PLCAutomata. 1
The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems
 In DIMACS Graph Drawing '94, volume 894 of LNCS
, 1994
"... . In [JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph of a given graph. One of the motivations was to produce a nice drawing of a given graph by drawing the found maximum planar subgraph, and then augmenting this drawing by the removed edges. Our exper ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
. In [JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph of a given graph. One of the motivations was to produce a nice drawing of a given graph by drawing the found maximum planar subgraph, and then augmenting this drawing by the removed edges. Our experiments indicate that drawing algorithms for planar graphs which require 2 or 3connectivity, resp. degreeconstraints, in addition to planarity often give "nicer" results. Thus we are led to the following problems: (1) Find a maximum planar subgraph with maximum degree d 2 IN. (2) Augment a planar graph to a kconnected planar graph. (3) Find a maximum planar kconnected subgraph of a given k connected graph. (4) Given a graph G, which is not necessarily planar and not necessarily kconnected, determine a new graph H by removing r edges and adding a edges such that the new graph H is planar, spanning, kconnected, each node v has degree at most D(v) and r + a is minimum. Problems (1), (2...