Hello everybody!
Could anyone help with a practical graph isomorphism algorithm, coded
in C++ (C would also do), to work with genus bounded graphs of a
bounded degree.
Currently, any algorithm to work with planar graphs with degree bounded
by 4 (on a quadratic grid) would also help.
Thanks a lot,
Alex.
--
Posted via http://dbforums.com