1963 search results - page 260 / 393 » The Maximum Solution Problem on Graphs |
169
click to vote
PODC
2011
ACM
14 years 3 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
92
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
ESA
2005
Springer
15 years 6 months ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
123
click to vote
GG
2008
Springer
15 years 1 months ago
2008
Springer
The model-driven development of model transformations requires both a technique to model model transformations as well as a means to transform transformation models. Therefore, t...
88
Voted
WDAG
2007
Springer
15 years 6 months ago
2007
Springer
We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a ...