Daniel Delling, Andrew V. Goldberg, Ilya Razenshteyn, Renato Fonseca F. Werneck. Exact Combinatorial Branch-and-Bound for Graph Bisection. In David A. Bader, Petra Mutzel, editors, Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, ALENEX 2012, The Westin Miyako, Kyoto, Japan, January 16, 2012. pages 30-44, SIAM / Omnipress, 2012. [doi]
@inproceedings{DellingGRW12,
title = {Exact Combinatorial Branch-and-Bound for Graph Bisection},
author = {Daniel Delling and Andrew V. Goldberg and Ilya Razenshteyn and Renato Fonseca F. Werneck},
year = {2012},
url = {http://siam.omnibooksonline.com/2012ALENEX/data/papers/015.pdf},
researchr = {https://researchr.org/publication/DellingGRW12},
cites = {0},
citedby = {0},
pages = {30-44},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, ALENEX 2012, The Westin Miyako, Kyoto, Japan, January 16, 2012},
editor = {David A. Bader and Petra Mutzel},
publisher = {SIAM / Omnipress},
}