9842 search results - page 236 / 1969 » The Complexity of the Matching-Cut Problem |
115
Voted
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
134
click to vote
TWC
2010
14 years 10 months ago
2010
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus-noise rat...
145
Voted
CIE
2007
Springer
15 years 9 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
142
click to vote
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
138
Voted
PODS
2008
ACM
16 years 3 months ago
2008
ACM
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...