GIT—a heuristic program for testing pairs of directed line graphs for isomorphism (Q5736478)

From MaRDI portal
Revision as of 08:27, 2 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3200107
Language Label Description Also known as
English
GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
scientific article; zbMATH DE number 3200107

    Statements

    title
    GIT—a heuristic program for testing pairs of directed line graphs for isomorphism (English)
    0 references
    author
    S. H. Unger
    0 references
    publication date
    1964
    0 references
    zbMATH Keywords
    numerical analysis
    0 references

    Identifiers

    DOI
    10.1145/363872.363899
    0 references
    zbMATH DE Number
    3200107
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5736478&oldid=10201349"
      Powered by MediaWiki