"Lower bounds on time complexity for some subgraph detection problems."

Masanari Arai et al. (1986)

> Home

Details and statistics

DOI: 10.1002/SCJ.4690170611

access: closed

type: Journal Article

metadata version: 2023-09-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scjapan/AraiYHIH86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scjapan/AraiYHIH86
Masanari Arai, Masafumi Yamashita, Tomio Hirata, Toshihide Ibaraki, Namio Honda:
Lower bounds on time complexity for some subgraph detection problems. Syst. Comput. Jpn. 17(6): 95-102 (1986)

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.