The QAP-polytope and the graph isomorphism problem
type: Item
instance of: scholarly article
title: The QAP-polytope and the graph isomorphism problem
zbMATH Open document ID: 1412.90087
author: Pawan Aurora
author: Shashank K. Mehta
published in: Journal of Combinatorial Optimization
publication date: 2018-12-06T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6990039
zbMATH Keywords: quadratic assignment problem
zbMATH Keywords: graph isomorphism problem
zbMATH Keywords: polyhedral combinatorics
describes a project that uses: nauty
describes a project that uses: Traces
MaRDI profile type: Publication
full work available at URL: s10878-018-0266-x
OpenAlex ID: W2788334612
cites work: Q4091421
cites work: Q3396558
cites work: Sherali-Adams relaxations and indistinguishability in counting logics
cites work: Q3912033
cites work: On the automorphism groups of strongly regular graphs I
cites work: Graph isomorphism in quasipolynomial time [extended abstract]
cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
cites work: Does co-NP have short interactive proofs ?
cites work: An optimal lower bound on the number of variables for graph identification
cites work: Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
cites work: Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations
cites work: Q4198056
cites work: Structure theorem and isomorphism test for graphs with excluded topological subgraphs
cites work: Pebble Games and Linear Equations
cites work: Isomorphism of Planar Graphs (Working Paper)
cites work: Q4148000
cites work: Box-inequalities for quadratic assignment polytopes
cites work: Q4397722
cites work: Reducibility among Combinatorial Problems
cites work: Efficient Parallel Algorithms for Chordal Graphs
cites work: Interval Graphs: Canonical Representation in Logspace
cites work: Global optimization with polynomials and the problem of moments
cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: Sherali-Adams relaxations of graph isomorphism polytopes
cites work: A note on the graph isomorphism counting problem
cites work: Practical graph isomorphism. II.
cites work: Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs
cites work: Copositive and semidefinite relaxations of the quadratic assignment problem
cites work: Graph isomorphism is in the low hierarchy
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: Q4228513
cites work: A note on compact graphs
cites work: Simple Geometrical Intersection Graphs
cites work: Q3312272
Wikidata QID: Q130195012
DOI: 10.1007/S10878-018-0266-X
description: scientific article; zbMATH DE number 6990039