Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A general method for graph isomorphism

Autor
Valiente, G.
Tipus d'activitat
Article en revista
Revista
Lecture notes in computer science
Data de publicació
2001-01
Volum
2138
Número
1
Pàgina inicial
428
Pàgina final
431
DOI
https://doi.org/10.1007/3-540-44669-9_49 Obrir en finestra nova
URL
https://link.springer.com/chapter/10.1007/3-540-44669-9_49 Obrir en finestra nova
Resum
A general method is presented for testing graph isomorphism, which exploits those sufficient conditions that define linear orderings on the vertices of the graphs. The method yields simple and constructive, low-order polynomial graph isomorphism algorithms for classes of graphs which have a unique ordering, or a small (not necessarily bounded) number of different orderings. The general method is instantiated to several graph classes, including: interval graphs, outer-planar graphs, biconnected o...
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants