836 search results - page 7 / 168 » Orthogonal Colorings of Graphs |
GD
1998
Springer
15 years 3 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
15 years 6 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...
118
click to vote
CCCG
2009
15 years 23 days ago
2009
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
WADT
1998
Springer
15 years 3 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...
100
click to vote
ALGORITHMICA
2008
14 years 11 months ago
2008
We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...