Subexponential Time Algorithms for Embedding H-Minor Free Graphs (Q4598141): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
label / en | label / en | ||
Subexponential Time Algorithms for Embedding H-Minor Free Graphs | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.4230/lipics.icalp.2016.9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2551041103 / rank | |||
Normal rank | |||
Property / title | |||
Subexponential Time Algorithms for Embedding H-Minor Free Graphs (English) | |||
Property / title: Subexponential Time Algorithms for Embedding H-Minor Free Graphs (English) / rank | |||
Normal rank |
Latest revision as of 10:59, 30 July 2024
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