9842 search results - page 281 / 1969 » The Complexity of the Matching-Cut Problem |
98
Voted
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
117
Voted
DEXAW
2008
IEEE
15 years 7 months ago
2008
IEEE
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...
94
Voted
WCC
2005
Springer
15 years 6 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
105
click to vote
FCS
2006
15 years 2 months ago
2006
The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with th...
102
click to vote
IPL
2007
15 years 16 days ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...