1749 search results - page 104 / 350 » Conditional colorings of graphs |
142
click to vote
CAV
2007
Springer
16 years 18 days ago
2007
Springer
Three-color parity games capture the disjunction of a B¨uchi and a co-B¨uchi condition. The most efficient known algorithm for these games is the progress measures algorithm by ...
324
click to vote
AAECC
2011
Springer
15 years 1 months ago
2011
Springer
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman’s algorithm. Algebra...
198
click to vote
DM
2002
15 years 6 months ago
2002
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
191
click to vote
LCPC
1994
Springer
15 years 10 months ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
172
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...