617 search results - page 89 / 124 » On the Chromatic Number of Random Graphs |
154
click to vote
TCS
2010
15 years 2 months ago
2010
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
164
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
141
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
125
click to vote
SODA
1996
ACM
15 years 5 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
158
click to vote
IJON
2010
15 years 2 months ago
2010
We introduce a new causal hierarchical belief network for image segmentation. Contrary to classical tree structured (or pyramidal) models, the factor graph of the network contains...