836 search results - page 90 / 168 » Orthogonal Colorings of Graphs |
GD
1995
Springer
15 years 5 months ago
1995
Springer
Abstract. When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightn...
106
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
114
click to vote
COCO
2007
Springer
15 years 8 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
117
click to vote
FCT
2007
Springer
15 years 5 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
120
click to vote
ACTA
2008
15 years 2 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...