We present a new method of obtaining tighter lower bounds on the bisection width. This method makes use of the level structure defined by the bisection. We ...
New spectral lower bounds on the bisection width of graphs. S ... We present a new method of obtaining tighter lower bounds on the bisection width.
Jul 18, 2002 · Under certain conditions we get a lower bound depending on with 1/2 ⩽ β < 1. We also present examples of graphs for which our new bounds are ...
We also present examples of graphs for which our new bounds are tight up to a constant factor. As a by-product, we derive new lower bounds for the bisection ...
A new lower bound on the bisection width of random 3-regular graphs on $n$ vertices is given based on a first moment method together with a structural ...
Under certain conditions we get a lower bound depending on λ2β|V| with 1/2 ≤ β < 1. We also present examples of graphs for which our new bounds are tight up to ...
We discuss the case for which this fact is not satisfied and present a new method to get tighter lower bounds on the bisection width. This method makes use of ...
New spectral lower bounds on the bisection width of graphs. S. Bezrukov, R. Elsässer, B. Monien, R. Preis, J.-P. Tillich, Theoretical Computer Science (2004) ...
New spectral lower bounds on the bisection width of graphs ...
journals.scholarsportal.info › details
We present a new method of obtaining tighter lower bounds on the bisection width. This method makes use of the level structure defined by the bisection. We ...
The book deals with important chapters from the ancient history of the eastern Alpine and Adriatic regions as well as the western Balkans. Illyricum equals more ...