Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most Three
Computational Complexity
2016-04-29 v2 Data Structures and Algorithms
Abstract
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. We give a polynomial time graph isomorphism algorithm for graphs with clique-width at most three. Our work is independent of the work by Grohe et al. \cite{grohe2015isomorphism} showing that the isomorphism problem for graphs of bounded clique-width is polynomial time.
Cite
@article{arxiv.1506.01695,
title = {Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most Three},
author = {Bireswar Das and Murali Krishna Enduri and I. Vinod Reddy},
journal= {arXiv preprint arXiv:1506.01695},
year = {2016}
}