9842 search results - page 252 / 1969 » The Complexity of the Matching-Cut Problem |
116
Voted
ICASSP
2010
IEEE
15 years 23 days ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
110
Voted
CORR
2006
Springer
15 years 18 days ago
2006
Springer
The paper analyzes CFVZ, a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the co...
86
Voted
IANDC
1998
15 years 7 days ago
1998
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
101
click to vote
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
COCO
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...