Convex graph invariant relaxations for graph edit distance

DOI10.1007/s10107-020-01564-4zbMath1489.90202arXiv1904.08934OpenAlexW3085534486MaRDI QIDQ2118089

Utkan Onur Candogan, Venkat Chandrasekaran

Publication date: 22 March 2022

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.08934

zbMATH Keywords

convex optimizationstrongly regular graphssemidefinite programmingmaximum cutstability numbermajorization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Convex programming (90C25) Applications of mathematical programming (90C90)

Uses Software

• SDPT3
• CVX
• GEDEVO
• C-GRAAL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• Semidefinite programming relaxations for the quadratic assignment problem
• Edit distance-based kernel functions for structural pattern classification
• Exact matrix completion via convex optimization
• Lectures on Modern Convex Optimization
• Convex Graph Invariants
• Graph Implementations for Nonsmooth Convex Programs
• ORBITOPES
• Rank-Sparsity Incoherence for Matrix Decomposition
• A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation
• A distance measure between attributed relational graphs for pattern recognition
• A Fast Matching Algorithm for Graph-Based Handwriting Recognition
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Structural, Syntactic, and Statistical Pattern Recognition
• Convex Analysis
• The number of maximum independent sets in graphs

This page was built for publication: Convex graph invariant relaxations for graph edit distance