A nonfactorial algorithm for testing isomorphism of two graphs (Q787177)

From MaRDI portal
Revision as of 10:08, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
A nonfactorial algorithm for testing isomorphism of two graphs
scientific article

    Statements

    A nonfactorial algorithm for testing isomorphism of two graphs (English)
    0 references
    0 references
    1983
    0 references
    nonfactorial algorithm
    0 references
    graph-isomorphism-problem
    0 references
    branch-and-bound technique
    0 references

    Identifiers