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 |
|---|---|---|---|
| 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
