1461 search results - page 138 / 293 » Complexity of Graph Covering Problems |
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
AAAI
2010
14 years 11 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
DIALM
2005
ACM
15 years 19 hour ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
UAI
2003
14 years 11 months ago
2003
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...