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 条
  • [21] The rank-width of the square grid
    Jelinek, Vit
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (07) : 841 - 850
  • [22] On Low Rank-Width Colorings
    Kwon, O-joung
    Pilipczuk, Michal
    Siebertz, Sebastian
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2017), 2017, 10520 : 372 - 385
  • [23] Canonisation and Definability for Graphs of Bounded Rank Width
    Grohe, Martin
    Neuen, Daniel
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2023, 24 (01)
  • [24] Canonisation and Definability for Graphs of Bounded Rank Width
    Grohe, Martin
    Neuen, Daniel
    2019 34TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2019,
  • [25] Isomorphism Testing for Graphs of Bounded Rank Width
    Grohe, Martin
    Schweitzer, Pascal
    2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 1010 - 1029
  • [26] Rank-width: Algorithmic and structural results
    Oum, Sang-il
    DISCRETE APPLIED MATHEMATICS, 2017, 231 : 15 - 24
  • [27] Excluded vertex-minors for graphs of linear rank-width at most k
    Jeong, Jisu
    Kwon, O-joung
    Oum, Sang-il
    EUROPEAN JOURNAL OF COMBINATORICS, 2014, 41 : 242 - 257
  • [28] Approximating rank-width and clique-width quickly
    Oum, S
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 49 - 58
  • [29] Graph operations characterizing rank-width
    Courcelle, Bruno
    Kante, Mamadou Moustapha
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (04) : 627 - 640
  • [30] Rank-width and vertex-minors
    Oum, SI
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 95 (01) : 79 - 100