6740 search results - page 443 / 1348 » An s -Hamiltonian Line Graph Problem |
219
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
235
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
192
click to vote
ALT
2007
Springer
16 years 3 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
161
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
203
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...