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 the normal view instead:
scientific article; zbMATH DE number 6502583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9846689105033876
0 references
0.857081949710846
0 references
0.856989860534668
0 references
0.8070937991142273
0 references
0.8053580522537231
0 references
