Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS(2006)
摘要
It is known that any chordal graph can be uniquely decomposed into simplicial components. Based on this fact, it is shown that for a given chordal graph, its automorphism group can be computed in O((c! · n)O(1)) time, where c denotes the maximum size of simplicial components and n denotes the number of nodes. It is also shown that isomorphism of those chordal graphs can be decided within the same time bound. From the viewpoint of polynomial-time computability, our result strictly strengthens the previous ones respecting the clique number.
更多查看译文
关键词
clique number,simplicial components,n denotes,computing automorphism groups,polynomial-time computability,chordal graph,small size,maximum size,automorphism group,simplicial component,chordal graphs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要