"On the obfuscation complexity of planar graphs."

Oleg Verbitsky (2008)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2008.02.032

access: open

type: Journal Article

metadata version: 2022-10-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/Verbitsky08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Verbitsky08
Oleg Verbitsky:
On the obfuscation complexity of planar graphs. Theor. Comput. Sci. 396(1-3): 294-300 (2008)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.