1461 search results - page 84 / 293 » Complexity of Graph Covering Problems |
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
COCOON
2000
Springer
14 years 1 days ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
EUROCOLT
1995
Springer
13 years 11 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
AIPS
2008
13 years 10 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
TAMC
2010
Springer
14 years 23 days ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...