Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Isomorphism testing for \(T\)-graphs in FPT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precoloring extension. I: Interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tractable Parameterizations of Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Proper Tree-Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(H\)-topological intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems on \(H\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cutwidth and the Topological Bandwidth of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On testing isomorphism of permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending partial representations of subclasses of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6075968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism problem / rank
 
Normal rank

Latest revision as of 13: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
    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
    0 references