2310 search results - page 175 / 462 » Coloring Random Graphs |
137
Voted
ICIP
2003
IEEE
16 years 4 months ago
2003
IEEE
A new probabilistic image segmentation model based on hypothesis testing and Gibbs Random Fields is introduced. First, a probabilistic difference measure derived from a set of hyp...
109
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
113
click to vote
DAM
2010
15 years 2 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...
143
click to vote
MFCS
2010
Springer
15 years 27 days ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
111
click to vote
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...