Abstract: Graph isomorphism is an essential problem in graph theory and widely used in a variety of applications. With graph size increasing, graph isomorphism become difficult for classical ...

In October 2015 my time training mathematics teachers at a French high school in Port Vila, Vanuatu, was coming to an end. The principal invited me to share kava, a traditional drink in the country.

Abstract: Maximum common sub-graph isomorphism (MCS) is a famous NP-hard problem in graph processing. The problem has found application in many areas where the similarity of graphs is important, for ...

Add a description, image, and links to the graph-isomorphism topic page so that developers can more easily learn about it.

On March 15, intriguing seminar announcements sent rumblings through the field of combinatorics, the mathematical study of counting. Three collaborators planned to give coordinated talks the following ...

The deep connections between logic and automata theory have led to extensive applications in formal specification and verification of systems. In recent years, research has focused on extensibility of ...