9842 search results - page 1376 / 1969 » The Complexity of the Matching-Cut Problem |
189
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
224
click to vote
ICANNGA
2009
Springer
16 years 1 months ago
2009
Springer
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...
190
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
225
click to vote
MIDDLEWARE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The trend towards cloud and utility computing infrastructures raises challenges not only for application development, but also for management: diverse resources, changing...
203
click to vote
MIDDLEWARE
2009
Springer
16 years 1 months ago
2009
Springer
The innate dynamicity and complexity of mobile ad-hoc networks (MANETs) has resulted in numerous ad-hoc routing protocols being proposed. Furthermore, numerous variants and hybrids...