Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs (Q1765527): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph Isomorphism is in SPP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism and identification matrices: Sequential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval bigraphs and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the graph isomorphism counting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph isomorphism disease / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank

Latest revision as of 17:52, 7 June 2024

scientific article
Language Label Description Also known as
English
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
scientific article

    Statements

    Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2005
    0 references
    Graph isomorphism problem
    0 references
    Graph isomorphism complete
    0 references
    Strongly chordal graphs
    0 references
    Chordal bipartite graphs
    0 references

    Identifiers