Sciweavers

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

87

Voted

WG
2000
Springer

66views Theoretical Computer Science» more WG 2000»

New Spectral Lower Bounds on the Bisection Width of Graphs

15 years 6 months ago

New Spectral Lower Bounds on the Bisection Width of Graphs

Download www2.math.uni-paderborn.de

Sergei L. Bezrukov, Robert Elsässer, Burkhard

Real-time Traffic

Theoretical Computer Science | WG 2000 |

claim paper

Related Content

» Laplacian spectral bounds for clique and independence numbers of graphs

» On Geometric Dilation and Halving Chords

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	2000
Where	WG
Authors	Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich

Comments (0)