Login / Signup
On the obfuscation complexity of planar graphs.
Oleg Verbitsky
Published in:
Theor. Comput. Sci. (2008)
Keyphrases
</>
planar graphs
optimal solution
worst case
approximate inference