1461 search results - page 243 / 293 » Complexity of Graph Covering Problems |
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
White-box testing is an important method for the early detection of errors during software development. In this process test case generation plays a crucial role, defining appropr...
JETAI
2007
13 years 8 months ago
2007
Reasoning, problem solving, indeed the general process of acquiring knowledge, is not an isolated, homogenous affair involving a one agent using a single form of representation, b...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
DAM
2008
13 years 8 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...