Burkhard Monien, Robert Preis. Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In Jiri Sgall, Ales Pultr, Petr Kolman, editors, Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings. Volume 2136 of Lecture Notes in Computer Science, pages 524-536, Springer, 2001. [doi]
@inproceedings{MonienP01,
title = {Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs},
author = {Burkhard Monien and Robert Preis},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2136/21360524.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/MonienP01},
cites = {0},
citedby = {0},
pages = {524-536},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings},
editor = {Jiri Sgall and Ales Pultr and Petr Kolman},
volume = {2136},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42496-2},
}