"Computational complexity of computing a partial solution for the Graph ..."

Takayuki Nagoya, Seinosuke Toda (2009)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2009.01.001

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/NagoyaT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/NagoyaT09
Takayuki Nagoya, Seinosuke Toda:
Computational complexity of computing a partial solution for the Graph Automorphism problems. Theor. Comput. Sci. 410(21-23): 2064-2071 (2009)

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.