721 search results - page 25 / 145 » Almost universal graphs |
113
Voted
JGT
2010
14 years 11 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...
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
letons to Bone Graphs: Medial Abstraction for Object Recognition Diego Macrini University of Toronto Kaleem Siddiqi McGill University Sven Dickinson University of Toronto Medial d...
108
click to vote
ENTCS
2006
15 years 23 days ago
2006
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...
127
click to vote
DSD
2003
IEEE
15 years 6 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
113
Voted
CPC
2007
15 years 22 days 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 ...