Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi
From MaRDI portal
Publication:2555867
DOI10.1007/BF02575800zbMath0247.05134MaRDI QIDQ2555867
Publication date: 1972
Published in: Calcolo (Search for Journal in Brave)
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Zur Bestimmung der Automorphismen eines endlichen Graphen, Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie, A note on the derivation of maximal common subgraphs of two directed or undirected graphs, Graph isomorphism: A heuristic edge-partitioning-oriented algorithm, Graph isomorphism problem
Cites Work