Isomorphism Testing for Graphs of Bounded Rank Width
IEEE Symposium on Foundations of Computer Science(2015)
摘要
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.
更多查看译文
关键词
graph isomorphism,connectivity functions,canonical decomposition theorems,rank width,clique width
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要