A Faster Isomorphism Test for Graphs of Small Degree

DOI10.1137/19m1245293arXiv1802.04659OpenAlexW3007883572MaRDI QIDQ6139827

Daniel Neuen, Pascal Schweitzer, Martin Grohe

Publication date: 19 December 2023

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.04659

zbMATH Keywords

permutation groupsbounded degree graphsgraph isomorphismgroups with restricted composition factors

Mathematics Subject Classification ID

Cites Work

• Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
• On minimal degrees and base sizes of primitive permutation groups
• On the orders of primitive groups with restricted nonabelian composition factors
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• The isomorphism problem for classes of graphs closed under contraction
• Minimal degree for a permutation representation of a classical group
• Graph isomorphism, general remarks
• Bases for primitive permutation groups and a conjecture of Babai
• Bases of primitive linear groups.
• On the orders of primitive groups
• Bases of primitive linear groups. II.
• The Maximal Subgroups of the Low-Dimensional Finite Classical Groups
• Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
• Finite Permutation Groups and Finite Simple Groups
• Simple groups, permutation groups, and probability
• An improved isomorphism test for bounded-tree-width graphs
• Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
• Graph isomorphism in quasipolynomial time [extended abstract]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Faster Isomorphism Test for Graphs of Small Degree