Isomorphism Testing for Graphs of Bounded Rank Width
From MaRDI portal
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.
This page was built for publication: Isomorphism Testing for Graphs of Bounded Rank Width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6261793)
