Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi (Q2555867)

From MaRDI portal
Revision as of 11:53, 12 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi
scientific article

    Statements

    title
    Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi (English)
    0 references
    DOI
    10.1007/BF02575800
    0 references
    author
    Franco Sirovich
    0 references
    published in
    Calcolo
    0 references
    publication date
    1972
    0 references
    Mathematics Subject Classification ID
    05C20
    0 references
    05C25
    0 references
    05-04
    0 references
    zbMATH DE Number
    3390810
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2555867&oldid=34549463"
    Powered by MediaWiki