Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481)

From MaRDI portal
Revision as of 08:36, 7 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
scientific article

    Statements

    Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (English)
    0 references
    0 references
    16 February 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    intersection graph
    0 references
    isomorphism testing
    0 references
    chordal graph
    0 references
    \(H\)-graph
    0 references
    parameterized complexity
    0 references