Un metodo euristico per la verifica dell'isomorfismo di due grafi semplici non orientati. (A heuristic method for determinating the isomorphism of two simple non-oriented graphs)

DOI10.1007/BF02575571zbMath0221.05079MaRDI QIDQ2547224

R. Morpurgo

Publication date: 1971

Published in: Calcolo (Search for Journal in Brave)

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

A note on the derivation of maximal common subgraphs of two directed or undirected graphs ⋮ Graph isomorphism: A heuristic edge-partitioning-oriented algorithm ⋮ Metodi pseudo Runge-Kutta ottimali

Cites Work

• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
• Unnamed Item
• Unnamed Item
• Unnamed Item