9842 search results - page 278 / 1969 » The Complexity of the Matching-Cut Problem |
110
click to vote
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
109
click to vote
ADHOCNOW
2008
Springer
15 years 7 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
106
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
HICSS
2002
IEEE
15 years 5 months ago
2002
IEEE
The threat of abandoned or extensively overhauled IS is a major concern for both MIS specialists and businesses. This concern may stem from the mismatch between MIS specialist cha...
PODS
2007
ACM
16 years 23 days ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...