# Is graph isomorphism still open for bounded clique width or bounded rank width? 2015 paper claims it is polynomial [closed]

To my knowledge, graph isomorphism for graphs with bounded clique width or bounded rank width is open.

2015 arxiv paper claims it is polynomial:

Isomorphism Testing for Graphs of Bounded Rank Width

Abstract:

We give an algorithm that, for every fixed $k$, decides isomorphism of graphs of rank width at most $k$ in polynomial time. As the clique width of a graph is bounded in terms of its rank width, we also obtain a polynomial time isomorphism test for graph classes of bounded clique width.

The paper is 48 pages and doesn't appear published in peer reviewed journal. There is only one citation on Scholar.google.

Q1 Is graph isomorphism still open for bounded clique width or bounded rank width?

• The authors of this paper are strong and well-respected researchers. If you have found a mistake in their paper, you should simply contact them. – Gamow Dec 20 '15 at 7:56
• @Gamow I don't claim any mistake. – joro Dec 20 '15 at 8:21
• One of the authors is Pascal Schweitzer. His PhD thesis gave me a very good introduction into different existing approaches to solve graph isomorphism, and how to shoot them down. I also used his software while shooting down the Dharwadker-Tevet Graph Isomorphism algorithm. Very practical and down to earth, in a certain sense. – Thomas Klimpel May 15 '16 at 12:47