On NC algorithms for problems on bounded rank-width graphs

In this paper, we show that for a fixed k, there is an NC algorithm that separates the graphs of rank-width at most k from those with rank-width at leastby Bireswar Das, Anirban Dasgupta, Murali Krishna Enduri, and Vinod I. Reddy,2018-08-10 12:16:50https://doi.org/10.1016/j.ipl.2018.07.00