"Dynamic Complexity of Planar 3-Connected Graph Isomorphism."

Jenish C. Mehta (2014)

> Home

Details and statistics

DOI: 10.1007/978-3-319-06686-8_21

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/csr/Mehta14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csr/Mehta14
Jenish C. Mehta:
Dynamic Complexity of Planar 3-Connected Graph Isomorphism. CSR 2014: 273-286

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.