131 search results - page 5 / 27 » Orthogonal thickness of graphs |
COMBINATORICS
1999
13 years 7 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
CAPTECH
1998
Springer
13 years 11 months ago
1998
Springer
A method for matching sequences from two perspective views of a moving person silhouette is presented. Regular (approximate uniform thickness) parts are detected on an image and a ...
GD
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cub...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— We propose a unifying framework for max-min fairness in orthogonal networks and networks with interference. First, a universal formulation of the max-min fairness problem for o...
WADT
1998
Springer
13 years 11 months ago
1998
Springer
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in gene...