Results 1 
4 of
4
HumanGuided Tabu Search
 In Proceedings of the 18th National Conference on Artificial Intelligence
, 2002
"... We present a humanguidable and general tabu search algorithm. ..."
Abstract

Cited by 22 (9 self)
 Add to MetaCart
We present a humanguidable and general tabu search algorithm.
Simple and Efficient Bilayer Cross Counting
, 2002
"... We consider the problem of counting the interior edge crossings when a bipartite graph G = (V, E) with node set V and edge set E is drawn such that the nodes of the two shores of the bipartition are on two parallel lines and the edges are straight lines. The efficient solution of this problem is imp ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
(Show Context)
We consider the problem of counting the interior edge crossings when a bipartite graph G = (V, E) with node set V and edge set E is drawn such that the nodes of the two shores of the bipartition are on two parallel lines and the edges are straight lines. The efficient solution of this problem is important in layered graph drawing. Our main observation is that it can be reduced to counting the inversions of a certain sequence. This leads to an O(E + C) algorithm, where C denotes the set of pairwise interior edge crossings, as well as to a simple O(E log V) algorithm, where V small is the smaller cardinality node set in the bipartition of the node set V of the graph. We present the algorithms and the results of computational experiments with these and other algorithms on a large collection of instances.
An Experimental Comparison of Orthogonal Compaction Algorithms
 In Graph Drawing (Proc. GD 2000
, 2000
"... We present an experimental study in which we compare the stateoftheart methods for compacting orthogonal graph layouts. Given the shape of a planar orthogonal drawing, the task is to place the vertices and the bends on grid points so that the total area or the total edge length is minimised. We c ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We present an experimental study in which we compare the stateoftheart methods for compacting orthogonal graph layouts. Given the shape of a planar orthogonal drawing, the task is to place the vertices and the bends on grid points so that the total area or the total edge length is minimised. We compare four constructive heuristics based on rectangular dissection and on turnregularity, also in combination with two improvement heuristics based on longest paths and network flows, and an exact method which is able to compute provable optimal drawings of minimum total edge length. We provide a performance evaluation in terms of quality and running time. The test data consists of two testsuites already used in previous experimental research. In order to get hard instances, we randomly generated an additional set of planar graphs.
BendMinimal Orthogonal Drawing of NonPlanar Graphs
, 2004
"... This thesis belongs to the field of graph drawing research. It present s a new procedure for calculatp tl bend minimal shape of nonplanar graphswit givent opology. This met9 d is anextP,,9 oft he SimplePodevsnef drawing stKBRK9 SimplePodevsnef is a simplificatPD of t9 more complex Podevsnef  ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This thesis belongs to the field of graph drawing research. It present s a new procedure for calculatp tl bend minimal shape of nonplanar graphswit givent opology. This met9 d is anextP,,9 oft he SimplePodevsnef drawing stKBRK9 SimplePodevsnef is a simplificatPD of t9 more complex Podevsnef  also known as Kandinsky  st andard. Bot models guarant ee bendminimalit y for planar graphswit givent opology. Theygenerat ortatK9 drawings wit equal vertF size where mult,PD edges can be at hed t a single side of a node. In cont9F t t Kandinsky, SimplePodevsnef has cert, rests9BD,D on t9 split up of such bundles. The algorit9 present9 int hist hesis expandstd drawing st andard for nonplanar graphs. It tKpK crossing point of edges in a special way, and enablestbl t share identen9 grid points where appropriatK Hence it allows crossings of whole bundles of edges inst9 of single edges only. Furt,PB9EKp we show a sharp upper bound of t9 bend count fort he heuristu use of SimplePodevsnef for nonplanar graphs; we also present an ext9F ion oft he new metP d tB is ablet draw nonplanar clustus9,RDB . Clust ergraphs are an ext ension of graphs, wheret here exis t a hierarchical st,pKBp9 of clusters, in whicht he nodes oft he graph are organized.