Canonical Labelling of Site Graphs

DOI10.4204/EPTCS.116.3arXiv1306.2405MaRDI QIDQ6242581FDOQ6242581

Michael Pedersen, Nicolas Oury, Rasmus L. Petersen

Publication date: 10 June 2013

Abstract: We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with "many" automorphisms, and the partition refinement algorithm runs in sub-quadratic time for graphs with "few" bisimulation equivalences. This suite of algorithms was chosen based on the expectation that graphs fall in one of those two categories. If that is the case, a combined algorithm runs in sub-quadratic worst case time. Whether this expectation is reasonable remains an interesting open problem.

This page was built for publication: Canonical Labelling of Site Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6242581)