803 search results - page 85 / 161 » Independence in Direct-Product Graphs |
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
CORR
2010
Springer
15 years 26 days ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
121
click to vote
WINE
2005
Springer
15 years 6 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
SPAA
2009
ACM
15 years 7 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
150
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...