1749 search results - page 125 / 350 » Conditional colorings of graphs |
171
click to vote
COMPGEOM
2006
ACM
16 years 15 days ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
154
click to vote
ENTCS
2008
15 years 6 months ago
2008
Graphical notations are already popular for the design of software, as witnessed by the success of the Uniform Modeling Languages (UML). In this paper, we advocate the use of grap...
193
click to vote
HVEI
2010
15 years 8 months ago
2010
Perceptual image distortion measures can play a fundamental role in evaluating and optimizing imaging systems and image processing algorithms. Many existing measures are formulate...
150
click to vote
JGT
2008
15 years 6 months ago
2008
: A (g, f )-factor of a graph is a subset F of E such that for all v V, g(v) degF(v) f(v). Lovasz gave a necessary and sufficient condition for the existence of a (g, f )-factor...
157
click to vote
AINA
2010
IEEE
15 years 11 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...