The graph isomorphism problem on geometric graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2014

The graph isomorphism problem on geometric graphs


The graph isomorphism (GI) problem asks whether two given graphs are isomorphic or not. The GI problem is quite basic and simple, however, it\textquoterights time complexity is a long standing open problem. The GI problem is clearly in NP, no polynomial time algorithm is known, and the GI problem is not NP-complete unless the polynomial hierarchy collapses. In this paper, we survey the computational complexity of the problem on some graph classes that have geometric characterizations. Sometimes the GI problem becomes polynomial time solvable when we add some restrictions on some graph classes. The properties of these graph classes on the boundary indicate us the essence of difficulty of the GI problem. We also show that the GI problem is as hard as the problem on general graphs even for grid unit intersection graphs on a torus, that partially solves an open problem.
Fichier principal
Vignette du fichier
dmtcs-16-2-7.pdf (214.32 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01185616 , version 1 (20-08-2015)



Ryuhei Uehara. The graph isomorphism problem on geometric graphs. Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 2 (2), pp.87--96. ⟨10.46298/dmtcs.2076⟩. ⟨hal-01185616⟩


90 View
1310 Download



Gmail Facebook X LinkedIn More