A Solution of the Isomorphism Problem for Circulant Graphs

By Mikhail E. Muzychuk. 2004

126 citations recorded by the source corpus.

Subfields: Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/68cf760b1e426d19f68d00b3b99aa7e5e95c307d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

1. Tommi A. Junttila
2. Petteri Kaski

In Electrical and Electronic Engineering

1. Tommi A. Junttila
2. Petteri Kaski
3. Ferenc SzollHosi

In Geometry and Topology

1. Tommi A. Junttila
2. Petteri Kaski

Citations in the corpus

• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs (2007, background): “To briefly summarize current theoretical knowledge, while no polynomial-time algorithm is known in the context of arbitrary graphs, polynomialtime algorithms are known for numerous restricted families of graphs, including [5, 16, 28, 34], and there is considerable theoretical evidence, including [7,”