Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Induced subgraph isomorphism: are some patterns substantially easier than others? |
scientific article; zbMATH DE number 6502583
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Induced subgraph isomorphism: are some patterns substantially easier than others? |
scientific article; zbMATH DE number 6502583 |
Statements
Induced subgraph isomorphism: are some patterns substantially easier than others? (English)
0 references
30 October 2015
0 references
induced subgraph isomorphism
0 references
detecting subgraphs
0 references
counting subgraphs
0 references
time complexity
0 references
