Isomorphism Testing for Graphs of Bounded Rank Width

被引：27
|
作者：
Grohe, Martin [1 ]
Schweitzer, Pascal [1 ]
机构：
[1] Rhein Westfal TH Aachen, Aachen, Germany
来源：
2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE | 2015年
关键词：
CLIQUE-WIDTH; ALGORITHM;
D O I：
10.1109/FOCS.2015.66
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We give an algorithm that, for every fixed k, decides isomorphism of graphs of rank width at most k in polynomial time. As the rank width of a graph is bounded in terms of its clique width, we also obtain a polynomial time isomorphism test for graph classes of bounded clique width.
引用
收藏
页码：1010 / 1029
页数：20
相关论文
共 50 条
  • [1] Isomorphism, Canonization, and Definability for Graphs of Bounded Rank Width
    Grohe, Martin
    Neuen, Daniel
    COMMUNICATIONS OF THE ACM, 2021, 64 (05) : 98 - 105
  • [2] Isomorphism for Graphs of Bounded Distance Width
    K. Yamazaki
    H. L. Bodlaender
    B. de Fluiter
    D. M. Thilikos
    Algorithmica, 1999, 24 : 105 - 127
  • [3] Isomorphism for graphs of bounded distance width
    Yamazaki, K
    Bodlaender, HL
    de Fluiter, B
    Thilikos, DM
    ALGORITHMICA, 1999, 24 (02) : 105 - 127
  • [4] Isomorphism for graphs of bounded distance width
    Yamazaki, K.
    Bodlaender, H.L.
    de Fluiter, B.
    Thilikos, D.M.
    Algorithmica (New York), 1999, 24 (02): : 105 - 127
  • [5] Isomorphism for graphs of bounded distance width
    Yamazaki, K
    Bodlaender, HL
    de Fluiter, B
    Thilikos, DM
    ALGORITHMS AND COMPLEXITY, 1997, 1203 : 276 - 287
  • [6] Canonisation and Definability for Graphs of Bounded Rank Width
    Grohe, Martin
    Neuen, Daniel
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2023, 24 (01)
  • [7] 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,
  • [8] An Improved Isomorphism Test for Bounded-tree-width Graphs
    Grohe, Martin
    Neuen, Daniel
    Schweitzer, Pascal
    Wiebking, Daniel
    ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (03)
  • [9] Isomorphism for Graphs of Bounded Connected-Path-Distance-Width
    Otachi, Yota
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 455 - 464
  • [10] Better Polynomial Algorithms on Graphs of Bounded Rank-Width
    Ganian, Robert
    Hlineny, Petr
    COMBINATORIAL ALGORITHMS, 2009, 5874 : 266 - 277
12345