14 search results - page 2 / 3 » On 3-regular 4-ordered graphs |
DM
2007
13 years 5 months ago
2007
Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on metho...
ARSCOM
2004
13 years 5 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
SAC
2006
ACM
13 years 11 months ago
2006
ACM
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
ECCC
2000
13 years 5 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
SSIRI
2010
13 years 3 months ago
2010
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...