316 search results - page 26 / 64 » On almost self-complementary graphs |
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
RECOMB
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
JGT
2010
13 years 6 months ago
2010
An antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, . . . , m} such that all n vertex sums are...
CPC
2007
13 years 7 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...