Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod
(Springer, 2016-07)
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 ...