Exact branch and bound algorithm with symmetry breaking for the maximum balanced induced biclique problem

McCreesh, C. and Prosser, P. (2014) Exact branch and bound algorithm with symmetry breaking for the maximum balanced induced biclique problem. In: 11th International Conference, CPAIOR 2014, Cork, Ireland, 19-23 May 2014, pp. 226-234. ISBN 9783319070452 (doi:10.1007/978-3-319-07046-9_16)

Full text not currently available from Enlighten.

Abstract

We show how techniques from state-of-the-art branch and bound algorithms for the maximum clique problem can be adapted to solve the maximum balanced induced biclique problem. We introduce a simple and effective symmetry breaking technique. Finally, we discuss one particular class of graphs where the algorithm’s bound is ineffective, and show how to detect this situation and fall back to a simpler but faster algorithm. Computational results on a series of standard benchmark problems are included.

Item Type:Conference Proceedings
Additional Information:Lecture Notes in Computer Science: 8451
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Prosser, Dr Patrick and Mccreesh, Dr Ciaran
Authors: McCreesh, C., and Prosser, P.
College/School:College of Science and Engineering > School of Computing Science
ISSN:0302-9743
ISBN:9783319070452
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record