Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi (Q2555867): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5535994 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3285875 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Algorithm for Graph Isomorphism / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: GIT—a heuristic program for testing pairs of directed line graphs for isomorphism / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5515142 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3277097 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Point-symmetric graphs with a prime number of points / rank | |||
Normal rank |
Latest revision as of 11:53, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi |
scientific article |
Statements
Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi (English)
0 references
1972
0 references