Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs (Q5176596)

From MaRDI portal
Revision as of 01:37, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6409095
Language Label Description Also known as
English
Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs
scientific article; zbMATH DE number 6409095

    Statements

    Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 February 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references