Accelerating Backtrack Search

We describe a method to reduce the amount of computer time required to perform an exhaustive backtrack search. For the independent set problem, the simplest version of the method achieves speedups of 3-4 on the DIMACS test graph r500.5. More complicated versions can achieve even greater speedups.

By: James B. Shearer

Published in: RC23562 in 2005


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .