文章基本信息
- 标题：Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity
- 本地全文：下载
- 作者：Vikraman Arvind ; Gaurav Rattan
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2014
- 卷号：2014
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
We give a O ( k O ( k ) ) time isomorphism testing algorithm for graphs of eigenvalue multiplicity bounded by k which improves on the previous best running time bound of O ( 2 O ( k 2 log k ) ) .
- 关键词：Fixed-parameter tractable ; Graph Isomorphism
