604 search results - page 114 / 121 » On the Complexity of the Maximum Cut Problem |
ICDE
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new ...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
SIGECOM
2006
ACM
14 years 2 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
PODC
2004
ACM
14 years 2 months ago
2004
ACM
We introduce the distributed gradient clock synchronization problem. As in traditional distributed clock synchronization, we consider a network of nodes equipped with hardware clo...