| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6874119 | Information Processing Letters | 2018 | 11 Pages |
Abstract
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 least 3k+1.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Bireswar Das, Anirban Dasgupta, Murali Krishna Enduri, I. Vinod Reddy,