Practical graph isomorphism, II

@article{McKay2014PracticalGI,
  title={Practical graph isomorphism, II},
  author={Brendan D. McKay and Adolfo Piperno},
  journal={J. Symb. Comput.},
  year={2014},
  volume={60},
  pages={94-112}
}
Isomorphism Test for Digraphs with Weighted Edges
TLDR
This paper presents a method for extending the applicability of refinement algorithms to directed graphs with weighted edges using {Traces} as a reference software, and substantiates the claim that the performances of the original algorithm remain substantially unchanged.
Formulations for the Graph Isomorphism Problem and Related Problems
We present and compare various methods to construct efficient QUBO formulations for the Graph Isomorphism Problem—one of a very few problems in NP that is neither known to be solvable in polynomial
Recent Advances on the Graph Isomorphism Problem
TLDR
The main focus will be on Babai's quasi-polynomial time isomorphism test and subsequent developments that led to the design of isomorphicism algorithms with a quasi- polynomial parameterized running time of the from $n^{\polylog k}$, where $k$ is a graph parameter such as the maximum degree.
A Parallel Algorithm for Subgraph Isomorphism (Brief Announcement)
TLDR
This paper's ongoing work on designing a parallel algorithm for the subgraph (and graph) isomorphism problem is presented, which addresses challenges commonly faced when attempting to obtain a parallel algorithms for isomorphisms.
Constructing Hard Examples for Graph Isomorphism
TLDR
Experimental results demonstrate that the resulting graphs do provide hard examples that match the hardest known benchmarks for graph isomorphism.
Detecting almost symmetries of graphs
TLDR
A branch-and-bound framework to solve the problem of finding a subgraph of G formed by removing no more than k edges that minimizes the number of vertex orbits and considers the presented strategy as a heuristic for quickly finding almost symmetries of a graph G.
Fast Streaming Small Graph Canonization
TLDR
This paper presents an efficient data structure to approach the streaming graph canonization problem, namely a graph isomorphism discrete finite automaton and showcases its efficiency when compared to a non-streaming-aware method that simply recomputes the isomorphic information from scratch in each iteration.
Uniqueness Trees: A Possible Polynomial Approach to the Graph Isomorphism Problem
TLDR
It is proved that the novel `uniqueness tree' algorithm has polynomial time complexity in the worst case, and that it will always detect the presence of an isomorphism whenever one exists, and it is proposed that the algorithm will equivalently discern the lack of anIsomorphic whenever one does not exist.
...
...

References

SHOWING 1-10 OF 45 REFERENCES
A Performance Comparison of Five Algorithms for Graph Isomorphism
TLDR
This paper presents a benchmarking activity for characterize the performance of a bunch of algorithms for exact isomorphism: to this purpose a database of graphs specifically developed for this task is used.
Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version)
TLDR
The individualization-refinement paradigm for computing a canonical labeling and/or the automorphism group of a graph is investigated and a new partition refinement algorithm is proposed, together with graph invariants having a global nature.
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
TLDR
Within the general framework of backtracking algorithms based on individualization and refinement, data structures, subroutines, and pruning heuristics especially for fast handling of large and sparse graphs are developed.
Fast Algorithm for Graph Isomorphism Testing
TLDR
A novel approach to the graph isomorphism problem is presented, that tries to find a mapping between the two input graphs using backtracking, with a (possibly partial) automorphism precomputing that allows to prune the search tree.
Structural and logical approaches to the graph isomorphism problem
TLDR
This talk will focus on approaches based on structural graph theory and connections between logical definability and certain combinatorial algorithms for the isomorphism problem, and speak about two recent results that say that isomorphisms can be decided in polynomial time on graph classes with excluded topological subgraphs.
Conflict Propagation and Component Recursion for Canonical Labeling
TLDR
Two new search space pruning techniques, conflict propagation based on recorded failure information and recursion over nonuniformly joined components, are presented and Experimental results show that the techniques can result in substantial decrease in both search space sizes and run times.
The graph isomorphism disease
TLDR
The present state of the art of isomorphism testing is surveyed, its relationship to NP-completeness is discussed, and some of the difficulties inherent in this particularly elusive and challenging problem are indicated.
The Design and Analysis of Computer Algorithms
TLDR
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
A General Backtrack Algorithm for the Isomorphism Problem of Combinatorial Objects
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
TLDR
The isomorphism problem for graphs has been in recent years the object of a much research and it is not known whether there exists a polynomial-time algorithm for it.
...
...