9842 search results - page 348 / 1969 » The Complexity of the Matching-Cut Problem |
147
click to vote
WG
2001
Springer
15 years 8 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
128
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Learning dominant motion patterns or activities from a video is an important surveillance problem, especially in crowded environments like markets, subways etc., where tracking of...
114
click to vote
DAC
2004
ACM
16 years 5 months ago
2004
ACM
The negative effect of electromigration on signal and power line lifetime and functional reliability is an increasingly important problem for the physical design of integrated cir...
139
click to vote
ICCD
2003
IEEE
16 years 1 months ago
2003
IEEE
A critical problem in wide-issue superscalar processors is the limit on cycle time imposed by the central register file and operand bypass network. In this paper, a distributed re...
123
click to vote
SAGT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...