Subexponential Time Algorithms for Embedding H-Minor Free Graphs (Q4598141): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Subexponential Time Algorithms for Embedding H-Minor Free Graphs
Property / author
 
Property / author: Hans L. Bodlaender / rank
Normal rank
 
Property / author
 
Property / author: Hans L. Bodlaender / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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

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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references