2 citations · 3 across the 11 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2017
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
In this paper, we study the parallel and the space complexity of the graph isomorphism problem (\GI{}) for several parameterizations. Let be a…
cs.CC2015
Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most Three
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
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 graph…