2137 search results - page 112 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
142
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
177
click to vote
IPCO
2008
15 years 6 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
148
click to vote
JPDC
2007
15 years 4 months ago
2007
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
147
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
371
click to vote
COCOON
2011
Springer
14 years 4 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...