1461 search results - page 197 / 293 » Complexity of Graph Covering Problems |
SIGECOM
2006
ACM
14 years 2 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
DIALM
2004
ACM
14 years 2 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
CSL
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
CONSTRAINTS
2006
13 years 9 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...