Istituto di Scienza e Tecnologie dell'Informazione     
Levi G. Graph isomorphism: an heuristic edge-partitioning oriented algorithm. In: Computing, vol. 12 pp. 291 - 313. Springer-Verlag, 1974.
A new algorithm for testing isomorphism on directed and undirected graphs is described. It consists of an 0 (nΔ5) algorithm for partitioning node and edge sets, plus a heuristic procedure for deriving all the isomorphisms. the partitioning is described by a "connectivity graph" on which a sufficient condition for isomorphism can be tested.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional