Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481): Difference between revisions
From MaRDI portal
Latest revision as of 12:16, 31 July 2024
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
16 February 2023
0 references
intersection graph
0 references
isomorphism testing
0 references
chordal graph
0 references
\(H\)-graph
0 references
parameterized complexity
0 references
0 references
0 references
0 references