513 search results - page 59 / 103 » Soft Edge Coloring |
159
click to vote
MTA
2002
15 years 3 months ago
2002
Digital video applications exploit the intrinsic structure of video sequences. In order to obtain and represent this structure for video annotation and indexing tasks, the main ini...
176
click to vote
ENDM
2011
14 years 3 months ago
2011
We study a combinatorial game called Bichromatic Triangle Game, defined as follows. Two players R and B construct a triangulation on a given planar point set V . Starting from no...
141
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
127
click to vote
SAT
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
129
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...