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 条
  • [1] Better Polynomial Algorithms on Graphs of Bounded Rank-Width
    Ganian, Robert
    Hlineny, Petr
    COMBINATORIAL ALGORITHMS, 2009, 5874 : 266 - 277
  • [2] Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
    Ganian, Robert
    Hlineny, Petr
    Obdrzalek, Jan
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), 2010, 8 : 73 - 83
  • [3] Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
    Ganian, Robert
    Hlineny, Petr
    Obdrzalek, Jan
    FUNDAMENTA INFORMATICAE, 2013, 123 (01) : 59 - 76
  • [4] A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
    Ganian, Robert
    Hlineny, Petr
    Obdrzalek, Jan
    EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (03) : 680 - 701
  • [5] Solving Problems on Graphs of High Rank-Width
    Eiben, Eduard
    Ganian, Robert
    Szeider, Stefan
    ALGORITHMICA, 2018, 80 (02) : 742 - 771
  • [6] Solving Problems on Graphs of High Rank-Width
    Eduard Eiben
    Robert Ganian
    Stefan Szeider
    Algorithmica, 2018, 80 : 742 - 771
  • [7] Rank-width of random graphs
    Lee, Choongbum
    Lee, Joonkyung
    Oum, Sang-il
    JOURNAL OF GRAPH THEORY, 2012, 70 (03) : 339 - 347
  • [8] The Rank-Width of Edge-Coloured Graphs
    Mamadou Moustapha Kanté
    Michael Rao
    Theory of Computing Systems, 2013, 52 : 599 - 644
  • [9] The Rank-Width of Edge-Coloured Graphs
    Kante, Mamadou Moustapha
    Rao, Michael
    THEORY OF COMPUTING SYSTEMS, 2013, 52 (04) : 599 - 644
  • [10] Several notions of rank-width for countable graphs
    Courcelle, Bruno
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 123 : 186 - 214
12345