<XML><RECORDS><RECORD><REFERENCE_TYPE>10</REFERENCE_TYPE><REFNUM>9395</REFNUM><AUTHORS><AUTHOR>McCreesh,C.</AUTHOR><AUTHOR>Prosser,P.</AUTHOR></AUTHORS><YEAR>2012</YEAR><TITLE>Distributing an Exact Algorithm for Maximum Clique: maximising the costup</title><div style=position:absolute;top:-9999px;><a href=http://paydayloansnocreditcheckszouu.com >payday loans no credit checks</a><a href=http://paydaygamezjoav.com >payday game</a><a href=http://onlinepaydayloansukryb.com >online pay day loans</a><a href=http://paydayloannofaxwosho.com >payday loan no fax</a><a href=http://nationalpaydayloanbbxym.com >national payday loan</a></div></TITLE><PLACE_PUBLISHED>SoCS Technical Report Series</PLACE_PUBLISHED><PUBLISHER>Dept of Computing Science, University of Glasgow</PUBLISHER><PAGES>1-13</PAGES><ISBN>TR-2012-334</ISBN><LABEL>McCreesh:2012:9395</LABEL><ABSTRACT>We take an existing implementation of an algorithm for the maximum clique problem and modify it so that we can distribute it over an ad- hoc cluster of machines. Our goal was to achieve a signi cant speedup in performance with minimal development e ort, i.e. a maximum costup. We present a simple modi cation to a state-of-the-art exact algorithm for maximum clique that allows us to distribute it across many machines. An empirical study over large hard benchmarks shows that speedups of an order of magnitude are routine for 25 or more machines.</ABSTRACT></RECORD></RECORDS></XML>