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 条

[41] Classes of graphs with small rank decompositions are χ-bounded
Dvorak, Zdenek
Kral, Daniel
EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (04) : 679 - 683
[42] Parallel algorithm for testing isomorphism of undirected graphs
Chen, Ling
Yin, Xinchun
Jisuanji Gongcheng/Computer Engineering, 2002, 28 (06):
[43] A NONFACTORIAL ALGORITHM FOR TESTING ISOMORPHISM OF 2 GRAPHS
GOLDBERG, MK
DISCRETE APPLIED MATHEMATICS, 1983, 6 (03) : 229 - 236
[44] Induced Minor Free Graphs: Isomorphism and Clique-width
Belmonte, Remy
Otachi, Yota
Schweitzer, Pascal
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2016, 9224 : 299 - 311
[45] Isomorphism Testing for Graphs Excluding Small Minors
Grohe, Martin
Wiebking, Daniel
Neuen, Daniel
2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 625 - 636
[46] Isomorphism testing for circulant graphs Cn(a, b)
Nicoloso, Sara
Pietropaoli, Ugo
UTILITAS MATHEMATICA, 2012, 87 : 165 - 182
[47] ISOMORPHISM TESTING FOR GRAPHS EXCLUDING SMALL MINORS
Grohe, M. A. R. T. I. N.
Neuen, D. A. N. I. E. L.
Wiebking, D. A. N. I. E. L.
SIAM JOURNAL ON COMPUTING, 2023, 52 (01) : 238 - 272
[48] Algorithm and experiments in testing planar graphs for isomorphism
Kukluk, Jacek P.
Holder, Lawrence B.
Cook, Diane J.
Journal of Graph Algorithms and Applications, 2004, 8 (03) : 313 - 356
[49] Multicuts in unweighted graphs with bounded degree and bounded tree-width
Calinescu, G
Fernandes, CG
Reed, B
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 137 - 152
[50] Graphs of bounded twin-width are quasi-polynomially ?-bounded
Pilipczuk, Michal
Sokolowski, Marek
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2023, 161 : 382 - 406

← 1 2 3 4 5 →