Results 271 to 280 of about 21,630 (299)
Some of the next articles are maybe not open access.
Representation of Graphs on a Matrix Layout
Ninth International Conference on Information Visualisation (IV'05), 2006The 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.
B. Otjacques, F. Feltz
openaire +2 more sources
Onion graphs: aesthetics and layout
Proceedings 1993 IEEE Symposium on Visual Languages, 2002In 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, H.G. Jokstad, B. Gulla
openaire +2 more sources
Linear layouts of weakly triangulated graphs
Discrete Mathematics, Algorithms and Applications, 2014A graph [Formula: see text] is said to be triangulated if it has no chordless cycles of length 4 or more. Such a graph is said to be rigid if, for a valid assignment of edge lengths, it has a unique linear layout and non-rigid otherwise. Damaschke [Point placement on the line by distance data, Discrete Appl. Math.
Sidharth Pardeshi +3 more
openaire +3 more sources
Directed graphs and rectangular layouts
2007 6th International Asia-Pacific Symposium on Visualization, 2007This 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 +2 more sources
A survey of graph layout problems
ACM Computing Surveys, 2002Graph 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 Díaz, Jordi Petit
openaire +2 more sources
Layout Problems on Lattice Graphs
1999This work deals with bounds on the cost of layout problems for lattice graphs and random lattice graphs. Our main result in this paper is a convergence theorem for the optimal cost of the Minimum Linear Arrangement problem and the Minimum Sum Cut problem, for the case where the underlying graph is obtained through a subcritical site percolation process.
Josep Díaz +3 more
openaire +2 more sources
21st Annual Symposium on Foundations of Computer Science (sfcs 1980), 1980
Minimizing the area of a circuit is an important problem in the domain of Very Large Scale Integration. We use a theoretical VLSI model to reduce this problem to one of laying out a graph, where the transistors and wires of the circuit are identified with the vertices and edges of the graph.
openaire +2 more sources
Minimizing the area of a circuit is an important problem in the domain of Very Large Scale Integration. We use a theoretical VLSI model to reduce this problem to one of laying out a graph, where the transistors and wires of the circuit are identified with the vertices and edges of the graph.
openaire +2 more sources
Proceedings of the 4th annual ACM symposium on User interface software and technology - UIST '91, 1991
Tyson R. Henry, Scott E. Hudson
openaire +2 more sources
Tyson R. Henry, Scott E. Hudson
openaire +2 more sources
Efficient Genealogical Graph Layout
2016While a visual unconstrained tree structure planar layout design is easy to implement, a visualization of a tree with constraints on node ranks and their ordering within ranks leads to a difficult combinatorial problem. A genealogical graph, such as family tree, can be taken as an example of such a case.
openaire +2 more sources
Automatically identifying potential regressions in the layout of responsive web pages
Software Testing Verification and Reliability, 2020Thomas A Walsh, Phil Mcminn
exaly