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 条

[11] On NC algorithms for problems on bounded rank-width graphs
Das, Bireswar
Dasgupta, Anirban
Enduri, Murali Krishna
Reddy, I. Vinod
INFORMATION PROCESSING LETTERS, 2018, 139 : 64 - 67
[12] ON TESTING ISOMORPHISM OF PERMUTATION GRAPHS
COLBOURN, CJ
NETWORKS, 1981, 11 (01) : 13 - 21
[13] 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
[14] ISOMORPHISM TESTING AND CANONICAL-FORMS FOR K-CONTRACTABLE GRAPHS (A GENERALIZATION OF BOUNDED VALENCE AND BOUNDED GENUS)
MILLER, GL
LECTURE NOTES IN COMPUTER SCIENCE, 1983, 158 : 310 - 327
[15] Metric Dimension of Bounded Width Graphs
Belmonte, Remy
Fomin, Fedor V.
Golovach, Petr A.
Ramanujan, M. S.
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT II, 2015, 9235 : 115 - 126
[16] UNIVERSAL GRAPHS FOR GRAPHS WITH BOUNDED PATH-WIDTH
TAKAHASHI, A
UENO, S
KAJITANI, Y
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1995, E78A (04) : 458 - 462
[17] Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract)
Arvind, Vikraman
Nedela, Roman
Ponomarenko, Ilia
Zeman, Peter
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2022), 2022, 13453 : 29 - 42
[18] Rank-width of random graphs
Lee, Choongbum
Lee, Joonkyung
Oum, Sang-il
JOURNAL OF GRAPH THEORY, 2012, 70 (03) : 339 - 347
[19] Isomorphism for Graphs of Bounded Feedback Vertex Set Number
Kratsch, Stefan
Schweitzer, Pascal
ALGORITHM THEORY - SWAT 2010, PROCEEDINGS, 2010, 6139 : 81 - 92
[20] TESTING ISOMORPHISM OF OUTERPLANAR GRAPHS IN PARALLEL
CHLEBUS, BS
DIKS, K
RADZIK, T
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 324 : 220 - 230

← 1 2 3 4 5 →