Tight lower bounds on graph embedding problems (Q4640290)
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: Tight lower bounds on graph embedding problems |
scientific article; zbMATH DE number 6869371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight lower bounds on graph embedding problems |
scientific article; zbMATH DE number 6869371 |
Statements
Tight Lower Bounds on Graph Embedding Problems (English)
0 references
17 May 2018
0 references
lower bounds
0 references
exponential time hypothesis
0 references
graph embedding
0 references
graph homomorphism
0 references
subgraph isomorphism
0 references
0.9275444746017456
0 references
0.8507857322692871
0 references
0.8406004905700684
0 references
0.8023685812950134
0 references
0.7738813757896423
0 references
