Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

GC
2002
Springer

favoriteEmaildiscussreport

126views Applied Computing» more GC 2002»

The Moore Bound for Irregular Graphs

13 years 4 months ago

The Moore Bound for Irregular Graphs

Download www.cs.tau.ac.il

Noga Alon, Shlomo Hoory, Nathan Linial

Real-time Traffic

Applied Computing | GC 2002 |

claim paper

Related Content

» Bounds on the decoding complexity of punctured codes on graphs

» Analysis of Low Density Codes and Improved Designs Using Irregular Graphs

» Irregularity strength of dense graphs

» Limitations of quantum coset states for graph isomorphism

» Some Inequalities For The Largest Eigenvalue Of A Graph

» Hierarchy Construction Schemes Within the Scale Set Framework

» Crossing numbers of imbalanced graphs

» Executing task graphs using workstealing

» Fast dynamic reranking in large graphs

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2002
Where	GC
Authors	Noga Alon, Shlomo Hoory, Nathan Linial

Comments (0)