Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs

B. Monien, R. Preis, in: Mathematical Foundations of Computer Science 2001, Berlin, Heidelberg, 2007.

Download
No fulltext has been uploaded.
Book Chapter | Published
Author
;
Publishing Year
Book Title
Mathematical Foundations of Computer Science 2001
ISSN
LibreCat-ID

Cite this

Monien B, Preis R. Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In: Mathematical Foundations of Computer Science 2001. Berlin, Heidelberg; 2007. doi:10.1007/3-540-44683-4_46
Monien, B., & Preis, R. (2007). Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In Mathematical Foundations of Computer Science 2001. Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_46
@inbook{Monien_Preis_2007, place={Berlin, Heidelberg}, title={Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs}, DOI={10.1007/3-540-44683-4_46}, booktitle={Mathematical Foundations of Computer Science 2001}, author={Monien, Burkhard and Preis, Robert}, year={2007} }
Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.” In Mathematical Foundations of Computer Science 2001. Berlin, Heidelberg, 2007. https://doi.org/10.1007/3-540-44683-4_46.
B. Monien and R. Preis, “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs,” in Mathematical Foundations of Computer Science 2001, Berlin, Heidelberg, 2007.
Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.” Mathematical Foundations of Computer Science 2001, 2007, doi:10.1007/3-540-44683-4_46.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar
ISBN Search