7 search results - page 1 / 2 » Exploring the Relationship Between Max-Cut and Stable Set Re... |
MP
2006
13 years 7 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
MSS
2008
IEEE
13 years 7 months ago
2008
IEEE
Abstract. We study farsighted coalitional stability in the context of TUgames. Chwe (1994, p.318) notes that, in this context, it is difficult to prove nonemptiness of the largest ...
PAMI
2006
13 years 7 months ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
A schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data ex...