7 citations · 7 across the 6 of their papers we have counts for
4 papers · 1 filter
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…
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…
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
Bireswar Das, Jacobo Toran, Fabian Wagner
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [Bod90],[YBFT99]. We give restric…
Log-space Algorithms for Paths and Matchings in k-trees
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [JT07]. However, for graphs of tree-width larger th…