Efficient SAT-Based Search for Longest Sensitisable Paths

Matthias Sauer, Jie Jiang, Alejandro Czutro, Ilia Polian, Bernd Becker. Efficient SAT-Based Search for Longest Sensitisable Paths. In Proceedings of the 20th IEEE Asian Test Symposium, ATS 2011, New Delhi, India, November 20-23, 2011. pages 108-113, IEEE Computer Society, 2011. [doi]

Abstract

Abstract is missing.