9842 search results - page 419 / 1969 » The Complexity of the Matching-Cut Problem |
142
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
111
click to vote
EOR
2006
15 years 4 months ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
141
click to vote
DAM
2007
15 years 4 months ago
2007
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
178
click to vote
ML
2000
ACM
15 years 4 months ago
2000
ACM
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...
144
click to vote
IOR
2002
15 years 4 months ago
2002
Then these analytically motivated abstractions were gradually made more intricate as the body of mathematical techniques grew. The trend went from elementary analysis of complex, i...