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 条
  • [21] Restricted space algorithms for isomorphism on bounded treewidth graphs
    Das, Bireswar
    Toran, Jacobo
    Wagner, Fabian
    INFORMATION AND COMPUTATION, 2012, 217 : 71 - 83
  • [22] RESTRICTED SPACE ALGORITHMS FOR ISOMORPHISM ON BOUNDED TREEWIDTH GRAPHS
    Das, Bireswar
    Toran, Jacobo
    Wagner, Fabian
    27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010), 2010, 5 : 227 - 238
  • [23] On the isomorphism problem for finite Cayley graphs of bounded valency
    Li, CH
    Praeger, CE
    EUROPEAN JOURNAL OF COMBINATORICS, 1999, 20 (04) : 279 - 292
  • [24] ISOMORPHISM OF K-CONTRACTIBLE GRAPHS - A GENERALIZATION OF BOUNDED VALENCE AND BOUNDED GENUS
    MILLER, GL
    INFORMATION AND CONTROL, 1983, 56 (1-2): : 1 - 20
  • [25] Subgraph isomorphism, log-bounded fragmentation and graphs of (locally) bounded treewidth
    Hajiaghayi, MT
    Nishimura, N
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 305 - 318
  • [26] Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
    Hajiaghayi, MohammadTaghi
    Nishimura, Naomi
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2007, 73 (05) : 755 - 768
  • [27] On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
    Ganian, Robert
    Hlineny, Petr
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (07) : 851 - 867
  • [28] Partitioning Graphs of Bounded Tree-Width
    Guoli Ding
    Bogdan Oporowski
    Daniel P. Sanders
    Dirk Vertigan
    Combinatorica, 1998, 18 : 1 - 12
  • [29] Chordal graphs with bounded tree-width
    Castellvi, Jordi
    Drmota, Michael
    Noy, Marc
    Requile, Clement
    ADVANCES IN APPLIED MATHEMATICS, 2024, 157
  • [30] Layout of graphs with bounded tree-width
    Dujmovic, V
    Morin, P
    Wood, DR
    SIAM JOURNAL ON COMPUTING, 2005, 34 (03) : 553 - 579
12345