871 search results - page 143 / 175 » The vertex-cover polynomial of a graph |
80
Voted
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
COCO
2010
Springer
15 years 1 months ago
2010
Springer
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
110
click to vote
DILS
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Life science data sources represent a complex link-driven federation of publicly available Web accessible sources. A fundamental need for scientists today is the ability ...
60
Voted
ESA
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...