Benchmark Graphs for Practical Graph Isomorphism
From MaRDI portal
Publication:5111749
DOI10.4230/LIPICS.ESA.2017.60zbMATH Open1442.68180arXiv1705.03686MaRDI QIDQ5111749FDOQ5111749
Publication date: 27 May 2020
Abstract: The state-of-the-art solvers for the graph isomorphism problem can readily solve generic instances with tens of thousands of vertices. Indeed, experiments show that on inputs without particular combinatorial structure the algorithms scale almost linearly. In fact, it is non-trivial to create challenging instances for such solvers and the number of difficult benchmark graphs available is quite limited. We describe a construction to efficiently generate small instances for the graph isomorphism problem that are difficult or even infeasible for said solvers. Up to this point the only other available instances posing challenges for isomorphism solvers were certain incidence structures of combinatorial objects (such as projective planes, Hadamard matrices, Latin squares, etc.). Experiments show that starting from 1500 vertices our new instances are several orders of magnitude more difficult on comparable input sizes. More importantly, our method is generic and efficient in the sense that one can quickly create many isomorphism instances on a desired number of vertices. In contrast to this, said combinatorial objects are rare and difficult to generate and with the new construction it is possible to generate an abundance of instances of arbitrary size. Our construction hinges on the multipedes of Gurevich and Shelah and the Cai-F"{u}rer-Immerman gadgets that realize a certain abelian automorphism group and have repeatedly played a role in the context of graph isomorphism. Exploring limits of such constructions, we also explain that there are group theoretic obstructions to generalizing the construction with non-abelian gadgets.
Full work available at URL: https://arxiv.org/abs/1705.03686
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Practical graph isomorphism. II.
- On the Hardness of Graph Isomorphism
- Random Graph Isomorphism
- An optimal lower bound on the number of variables for graph identification
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Polynomial-time isomorphism test for groups with abelian Sylow towers.
- Graph isomorphism in quasipolynomial time [extended abstract]
- On finite rigid structures
- Conflict Propagation and Component Recursion for Canonical Labeling
- Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
- The Power of Counting Logics on Restricted Classes of Finite Structures
- Benchmark Graphs for Practical Graph Isomorphism
- Choiceless Polynomial Time on Structures with Small Abelian Colour Classes
- An exponential lower bound for individualization-refinement algorithms for graph isomorphism
- Subgroups of 3-Factor Direct Products
Cited In (10)
- Title not available (Why is that?)
- Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm
- Leveraging special-purpose hardware for local search heuristics
- Isomorphism Test for Digraphs with Weighted Edges.
- Graph Similarity and Approximate Isomorphism
- Constructing Hard Examples for Graph Isomorphism
- A Generic Framework for Engineering Graph Canonization Algorithms
- Robust worst cases for parity games algorithms
- Benchmark Graphs for Practical Graph Isomorphism
- A large database of graphs and its use for benchmarking graph isomorphism algorithms
Uses Software
Recommendations
- A large database of graphs and its use for benchmarking graph isomorphism algorithms 👍 👎
- Efficient Method to Perform Isomorphism Testing of Labeled Graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- Practical graph isomorphism. II. 👍 👎
- Graph Similarity and Approximate Isomorphism 👍 👎
- On Tractable Parameterizations of Graph Isomorphism 👍 👎
- Title not available (Why is that?) 👍 👎
- Approximate Graph Isomorphism 👍 👎
- Title not available (Why is that?) 👍 👎
- Efficient Suboptimal Graph Isomorphism 👍 👎
This page was built for publication: Benchmark Graphs for Practical Graph Isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111749)
