Subcomplete generalizations of graph isomorphism (Q1838044): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive graph labeling using double cosets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3253828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A V log V algorithm for isomorphism of triconnected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-Complete Problems Similar to Graph Isomorphism / 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: Computing the composition factors of a permutation group in polynomial time / 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: On the n<sup>log n</sup> isomorphism technique (A Preliminary Report) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5666716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4154737 / rank
 
Normal rank

Latest revision as of 18:29, 13 June 2024

scientific article
Language Label Description Also known as
English
Subcomplete generalizations of graph isomorphism
scientific article

    Statements

    Subcomplete generalizations of graph isomorphism (English)
    0 references
    1982
    0 references
    0 references
    0 references
    0 references
    0 references
    graph isomorphism
    0 references
    computational complexity
    0 references
    isomorphism complete
    0 references
    group intersection
    0 references
    0 references