Sciweavers

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

110

SODA
2003
ACM

81views Algorithms» more SODA 2003»

Smaller explicit superconcentrators

15 years 3 months ago

Smaller explicit superconcentrators

Download www.cs.tau.ac.il

d Abstract) N. Alon ∗ M. Capalbo † July 28, 2002 Using a new recursive technique, we present an explicit construction of an inﬁnite family of N-superconcentrators of density 44. The most economical previously known explicit graphs of this type have density around 60.

Noga Alon, Michael R. Capalbo

Real-time Traffic

Algorithms | Explicit Construction | Explicit Graphs | Inﬁnite Family | SODA 2003 |

claim paper

Related Content

» Smaller superconcentrators of density 28

» Balls and Bins Smaller Hash Families and Faster Evaluation

» Symbolic Systems Explicit Properties On Hybrid Approaches for LTL Symbolic Model Checking

» Parallel Option Price Valuations with the Explicit Finite Difference Method

» Computational approaches for realtime extraction of soft biometrics

» Minimized Models for Unsupervised PartofSpeech Tagging

» SPARE a Scalable algorithm for passive structure preserving ParameterAware model order RE...

» 3D Eigenfunction Expansion of Sparsely Sampled 2D Cortical Data

» Avoiding Full Extension Field Arithmetic in Pairing Computations

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2003
Where	SODA
Authors	Noga Alon, Michael R. Capalbo

Comments (0)