42 search results - page 8 / 9 » The Number of Tree Stars Is O *(1.357 k ) |
168
click to vote
WAOA
2005
Springer
16 years 4 days ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
188
click to vote
TC
2010
15 years 5 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
146
click to vote
COCOON
2007
Springer
16 years 26 days ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
211
click to vote
WADS
2007
Springer
16 years 24 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
197
click to vote
AAAI
2010
15 years 8 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...