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 条
12345