46 search results - page 9 / 10 » Coloring with no 2-Colored P4's |
FSTTCS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
ISIPTA
1999
IEEE
13 years 10 months ago
1999
IEEE
We explore a generalization of Ellsberg's paradox (2color scenario) to the Vague-Vague (V-V) case, in which neither of the probabilities (urns) is specified precisely, but on...
DAM
2010
13 years 5 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
JCT
2008
13 years 5 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
ASPDAC
2001
ACM
13 years 9 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...