316 search results - page 28 / 64 » On almost self-complementary graphs |
STOC
2002
ACM
14 years 8 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...
EUROGRAPHICS
2010
Eurographics
14 years 3 months ago
2010
Eurographics
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
ICPADS
2005
IEEE
14 years 1 months ago
2005
IEEE
Peer-to-Peer (P2P) applications typically use overlay networks to forward the content queries. However, due to the distributed fashion of the overlay establishment, the overlay ne...
RSA
2002
13 years 7 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
IPL
1998
13 years 7 months ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...