A Faster Isomorphism Test for Graphs of Small Degree
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)(2018)
摘要
In a recent breakthrough, Babai (STOC 2016) gave quasipolynomial graph isomorphism test. In this work, we give an improved isomorphism test for graphs of small degree: our algorithms runs in time n^O((log d)^c), where n is the number of vertices of the input graphs, d is the maximum degree of the input graphs, and c is an absolute constant. The best previous isomorphism test for graphs of maximum degree d due to Babai, Kantor and Luks (FOCS 1983) runs in time n^O(d log d).
更多查看译文
关键词
graph isomorphism, bounded degree graphs, group theory, groups with restricted composition factors
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络