2398 search results - page 287 / 480 » Constraint Programming and Graph Algorithms |
177
Voted
ALT
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
185
click to vote
PPOPP
1997
ACM
15 years 10 months ago
1997
ACM
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
207
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
152
click to vote
MST
2007
15 years 5 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
166
click to vote
PPDP
2004
Springer
15 years 11 months ago
2004
Springer
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...