Das, BireswarBireswarDasDasgupta, AnirbanAnirbanDasguptaEnduri, Murali KrishnaMurali KrishnaEnduriReddy, I. VinodI. VinodReddy2025-08-302025-08-302018-11-0110.1016/j.ipl.2018.07.0072-s2.0-85050452509https://d8.irins.org/handle/IITG2025/22712In 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 least 3k+1.falseClique-width | NP-complete | Parallel algorithms | Rank-widthArticle64-67November 20181arJournal0WOS:000445992000013