9842 search results - page 228 / 1969 » The Complexity of the Matching-Cut Problem |
117
Voted
STOC
2004
ACM
16 years 24 days 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...
121
click to vote
COCOON
2000
Springer
15 years 4 months 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...
100
Voted
AIPS
2009
15 years 1 months ago
2009
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
83
Voted
CJ
2010
15 years 19 days ago
2010
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present prac...
111
click to vote
MP
2008
15 years 14 days ago
2008
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...