"Characterizing the Complexity of Subgraph Isomorphism for Graphs of ..."

Arvind Gupta, Naomi Nishimura (1996)

> Home

Details and statistics

DOI: 10.1007/3-540-60922-9_37

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stacs/GuptaN96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/GuptaN96
Arvind Gupta, Naomi Nishimura:
Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. STACS 1996: 453-464

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.