492 search results - page 6 / 99 » Perfect Matching Preservers |
ISAAC
2000
Springer
14 years 2 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
ISAAC
2007
Springer
14 years 5 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
FLAIRS
2001
14 years 8 days ago
2001
This paper demonstrates that case-based reasoning is ideally suited to the creation of knowledge management systems. This is because of the close match between the activities of t...
COCO
2010
Springer
13 years 8 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
ISAAC
2009
Springer
14 years 5 months ago
2009
Springer