On NC algorithms for problems on bounded rank-width graphs

被引:0
|
作者
Das, Bireswar [1 ]
Dasgupta, Anirban [1 ]
Enduri, Murali Krishna [1 ]
Reddy, I. Vinod [1 ]
机构
[1] Indian Inst Technol Gandhinagar, Ahmadabad, Gujarat, India
关键词
Rank-width; NP-complete; Parallel algorithms; Clique-width; CLIQUE-WIDTH;
D O I
10.1016/j.ipl.2018.07.007
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:64 / 67
页数:4
相关论文
共 50 条