743 search results - page 105 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
124
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
307
click to vote
COCOON
2011
Springer
14 years 2 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...
104
Voted
STOC
2002
ACM
16 years 2 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
148
Voted
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
116
click to vote
APPROX
2005
Springer
15 years 7 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...