Results 121 to 130 of about 24,958 (160)

A survey of graph layout problems

ACM Computing Surveys, 2002
Graph layout problems are a particular class of combinatorial optimization problems whose goal is to find a linear layout of an input graph in such way that a certain objective cost is optimized. This survey considers their motivation, complexity, approximation properties, upper and lower bounds, heuristics and probabilistic analysis on random graphs ...
Maria Serna, Josep Diaz, Jordi Petit
exaly   +2 more sources

Constrained Graph Layout

Constraints, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weiqing He, Kim Marriott
openaire   +2 more sources

Representation of Graphs on a Matrix Layout

Ninth International Conference on Information Visualisation (IV'05), 2006
The need to visualize network data becomes increasingly crucial, as it appears in numerous domains like Web visualization, computer network monitoring, or social studies. Graphs and matrices are two well-known techniques to visualize network data.
Benoît Otjacques, Fernand Feltz
openaire   +1 more source

Flexible Graph Layout for the Web

Journal of Visual Languages & Computing, 2002
More powerful personal computers and higher network bandwidth has meant that graphics has become increasingly important on the web. Graph-based diagrams are one of the most important types of structured graphical information. Here we demonstrate how XML can be used as the basis for contents-based delivery of graph-based diagrams.
Trevor Hansen   +3 more
openaire   +1 more source

Directed graphs and rectangular layouts

2007 6th International Asia-Pacific Symposium on Visualization, 2007
This paper deals with the problem, arising in practice, of drawing a directed graph as a collection of disjoint, isothetic rectangles, where the rectangles of the nodes of each edge must touch and where the placement of the rectangles respects the ordering of the edges.
Adam L. Buchsbaum   +2 more
openaire   +1 more source

Symmetric Layout of Disconnected Graphs

2003
We present a linear time algorithm for drawing disconnected planar graphs with maximum number of symmetries. Our algorithm can be generalized to making symmetric arrangements of bounded disjoint objects in the plane.
Seok-Hee Hong 0001, Peter Eades
openaire   +1 more source

Onion graphs: aesthetics and layout

Proceedings 1993 IEEE Symposium on Visual Languages, 2002
In many engineering disciplines it is interesting to use diagrams which combine a graph notation with an onion notation. It is observed that such onion graphs lend themselves easily to some kinds of sophisticated tool support, but also that the need for tool support is significantly larger than for ordinary graphs.
Guttorm Sindre   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy