Benchmark Graphs for Practical Graph Isomorphism
From MaRDI portal
Publication:5111749
DOI10.4230/LIPIcs.ESA.2017.60zbMath1442.68180arXiv1705.03686MaRDI QIDQ5111749
Daniel Neuen, Pascal Schweitzer
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1705.03686
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (9)
Leveraging special-purpose hardware for local search heuristics ⋮ Robust worst cases for parity games algorithms ⋮ Unnamed Item ⋮ Constructing Hard Examples for Graph Isomorphism ⋮ Graph Similarity and Approximate Isomorphism ⋮ Benchmark Graphs for Practical Graph Isomorphism ⋮ A Generic Framework for Engineering Graph Canonization Algorithms ⋮ Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm ⋮ Isomorphism Test for Digraphs with Weighted Edges.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- An optimal lower bound on the number of variables for graph identification
- Practical graph isomorphism. II.
- Choiceless Polynomial Time on Structures with Small Abelian Colour Classes
- 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
- Random Graph Isomorphism
- On the Hardness of Graph Isomorphism
- On finite rigid structures
- Benchmark Graphs for Practical Graph Isomorphism
- An exponential lower bound for individualization-refinement algorithms for graph isomorphism
- Subgroups of 3-Factor Direct Products
- Graph isomorphism in quasipolynomial time [extended abstract]
This page was built for publication: Benchmark Graphs for Practical Graph Isomorphism
