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
来源：
INFORMATION PROCESSING LETTERS | 2018年 / 139卷
关键词：
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 条
  • [41] TREE PIVOT-MINORS AND LINEAR RANK-WIDTH
    Dabrowski, Konrad K.
    Dross, Francois
    Jeong, Jisu
    Kante, Mamadou M.
    Kwon, O-joung
    Oum, Sang-il
    Paulusma, Daniel
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (04) : 2922 - 2945
  • [42] PARAMETRIC PROBLEMS ON GRAPHS OF BOUNDED TREE-WIDTH
    FERNANDEZBACA, D
    SLUTZKI, G
    JOURNAL OF ALGORITHMS, 1994, 16 (03) : 408 - 430
  • [43] Vertex partitioning problems on graphs with bounded tree width
    Aravind, N. R.
    Kalyanasundaram, Subrahmanyam
    Kare, Anjeneya Swami
    DISCRETE APPLIED MATHEMATICS, 2022, 319 : 254 - 270
  • [44] PARAMETRIC PROBLEMS ON GRAPHS OF BOUNDED TREE-WIDTH
    FERNANDEZBACA, D
    SLUTZKI, G
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 621 : 304 - 316
  • [45] Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
    Isolde Adler
    Mamadou Moustapha Kanté
    O-joung Kwon
    Algorithmica, 2017, 78 : 342 - 377
  • [46] Efficient parallel algorithms for graphs of bounded tree-width
    Lagergren, J
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1996, 20 (01): : 20 - 44
  • [47] TREE PIVOT-MINORS AND LINEAR RANK-WIDTH
    Dabrowski, K. K.
    Dross, F.
    Jeong, J.
    Kante, M. M.
    Kwon, O-J.
    Oum, S-I.
    Paulusma, D.
    ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 577 - 583
  • [48] Efficient parallel algorithms for graphs of bounded tree-width
    Lagergren, J.
    Journal of Algorithms, 1996, 20 (01): : 20 - 44
  • [49] Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
    Adler, Isolde
    Kante, Mamadou Moustapha
    Kwon, O-Joung
    ALGORITHMICA, 2017, 78 (01) : 342 - 377
  • [50] Learning Small Decision Trees for Data of Low Rank-Width
    Dabrowski, Konrad K.
    Eiben, Eduard
    Ordyniak, Sebastian
    Paesani, Giacomo
    Szeider, Stefan
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 9, 2024, : 10476 - 10483
12345