Isomorphism Testing for Graphs of Bounded Rank Width
Discrete Mathematics
2015-05-15 v1 Data Structures and Algorithms
Combinatorics
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.
Cite
@article{arxiv.1505.03737,
title = {Isomorphism Testing for Graphs of Bounded Rank Width},
author = {Martin Grohe and Pascal Schweitzer},
journal= {arXiv preprint arXiv:1505.03737},
year = {2015}
}