On the obfuscation complexity of planar graphs

Oleg Verbitsky. On the obfuscation complexity of planar graphs. Theoretical Computer Science, 396(1-3):294-300, 2008. [doi]

Abstract

Abstract is missing.