Sciweavers

5889 search results - page 2 / 1178
» Graph Layout Problems
Sort
View
MVA
1996
13 years 7 months ago
Recognition of Composite Elements in Bar Graphs
The issue of graph recognition has been not always investigated until today though the subjects on the document image understanding are very interest and have proposed many method...
Naoko Yokokura, Toyohide Watanabe
PPL
2000
91views more  PPL 2000»
13 years 6 months ago
A Parallel Algorithm for Planar Orthogonal Grid Drawings
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott...
AICCSA
2005
IEEE
103views Hardware» more  AICCSA 2005»
13 years 12 months ago
Consistent graph layout for weighted graphs
In this paper we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the gra...
Dana Vrajitoru, Jason DeBoni
ENDM
2010
122views more  ENDM 2010»
13 years 6 months ago
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
Vinícius G. P. de Sá, Celina M. Herr...
COCOON
2006
Springer
13 years 10 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng