A new algorithm to obtain all maximum common subgraphs in molecular graphs using binary arithmethic and constraints satisfaction model