Subexponential time algorithms for embedding \(H\)-minor free graphs (Q4598141)
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: Subexponential time algorithms for embedding H-minor free graphs |
scientific article; zbMATH DE number 6820198
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subexponential time algorithms for embedding \(H\)-minor free graphs |
scientific article; zbMATH DE number 6820198 |
Statements
19 December 2017
0 references
subgraph isomorphism
0 references
graph minors
0 references
subexponential time
0 references
Subexponential Time Algorithms for Embedding H-Minor Free Graphs (English)
0 references
0.8254508972167969
0 references
0.8215493559837341
0 references
0.8214125037193298
0 references
0.8113885521888733
0 references
0.809045135974884
0 references
