Graph Similarity and Approximate Isomorphism
From MaRDI portal
Publication:5005120
DOI10.4230/LIPIcs.MFCS.2018.20OpenAlexW2963035730MaRDI QIDQ5005120
Gaurav Rattan, Gerhard J. Woeginger, Martin Grohe
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1802.08509
Related Items
Isomorphic Distances Among Elections, Unnamed Item, The Complexity of Homomorphism Indistinguishability
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Wiener maximum quadratic assignment problem
- Drawing graphs by eigenvectors: theory and practice
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- The quadratic assignment problem. Theory and algorithms
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
- Well-solvable cases of the QAP with block-structured matrices
- Practical graph isomorphism. II.
- Approximate Graph Isomorphism
- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm
- An eigendecomposition approach to weighted graph matching problems
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- Hospital Layout as a Quadratic Assignment Problem
- Subtree Isomorphism in O(n5/2)
- Benchmark Graphs for Practical Graph Isomorphism
- Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
- Graph isomorphism in quasipolynomial time [extended abstract]
- Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs
