131 search results - page 11 / 27 » Orthogonal thickness of graphs |
GD
2005
Springer
14 years 27 days ago
2005
Springer
Force-directed placement is a widely used approach to automatically arranging the nodes and edges of a relational diagram or graph in an aesthetically pleasing manner. The adoption...
DM
2008
13 years 7 months ago
2008
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded s...
GD
2001
Springer
13 years 12 months ago
2001
Springer
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We pose a modified version of the two-sided orthogonal Procrustes problem subject to a grouping constraint, and offer an efficient solution method. This problem has applications...
JGAA
2007
13 years 7 months ago
2007
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...