260 search results - page 33 / 52 » Resolution Complexity of Independent Sets in Random Graphs |
88
Voted
PODC
2005
ACM
15 years 3 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
MODELS
2009
Springer
15 years 4 months ago
2009
Springer
Model-based development of highly complex software systems leads to large models. Storing them in repositories offers the possibility to work with these models in a distributed env...
77
Voted
SIGMETRICS
2010
ACM
14 years 9 months ago
2010
ACM
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...