9842 search results - page 449 / 1969 » The Complexity of the Matching-Cut Problem |
190
click to vote
IWC
2000
15 years 7 months ago
2000
Intelligent user interfaces have been proposed as a means to overcome some of the problems that directmanipulation interfaces cannot handle, such as: information overflow problems...
213
click to vote
DAM
1999
15 years 7 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
204
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...
197
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
244
click to vote
TSP
2011
15 years 2 months ago
2011
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...