Graph pattern detection: Hardness for all induced patterns and faster non-induced cycles
© 2019 Association for Computing Machinery. We consider the pattern detection problem in graphs: given a constant size pattern graph H and a host graph G, determine whether G contains a subgraph isomorphic to H. We present the following new improved upper and lower bounds: We prove that if a pattern...
| Main Authors: | , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery (ACM),
2021-11-08T20:15:31Z.
|
| Subjects: | |
| Online Access: | Get fulltext |