492 search results - page 49 / 99 » Perfect Matching Preservers |
CATS
2008
15 years 1 months ago
2008
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S (G), if S is a maxim...
103
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-a property that eliminates spurious interprocedural...
87
Voted
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Two distinct models of feedback, suited for FDD (Frequency Division Duplex) and TDD (Frequency Division Duplex) systems respectively, have been widely studied in the literature. In...
118
click to vote
DISOPT
2010
14 years 12 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
BIOINFORMATICS
2006
14 years 12 months ago
2006
Motivation: The need for normalization in microarray experiments has been well documented in the literature. Currently, most analysis methods treat normalization and analysis as a...