"The Complexity of the Kn, n-Problem for Node Replacement Graph ..."

Konstantin Skodinis (2001)

> Home

Details and statistics

DOI: 10.1006/INCO.2000.3021

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/Skodinis01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Skodinis01
Konstantin Skodinis:
The Complexity of the K_{n, n}-Problem for Node Replacement Graph Languages. Inf. Comput. 168(2): 95-112 (2001)

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.