Graph isomorphism: mixed-integer convex optimization from first-order methods

DOI10.1007/978-3-032-27242-3_36MaRDI QIDQ7356194zbMATH OpenFDO

Authors Wenjie Xiao, Mathieu Besançon, Patrick Gelß, Deborah Hendrych, Stefan Klus, Sebastian Pokutta

Publication date 23 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27242-3_36

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cites work

• A spectral assignment approach for the graph isomorphism problem
• Algorithms for the Assignment and Transportation Problems
• Conditional gradient methods. From core principles to AI applications
• Continuous optimization methods for the graph isomorphism problem
• Convex mixed-integer optimization with Frank-Wolfe methods
• Fibonacci heaps and their uses in improved network optimization algorithms
• FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients
• Graph isomorphism problem
• GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Isomorphism of planar graphs (working paper)
• Listing all maximal cliques in large sparse real-world graphs
• On convex relaxation of graph isomorphism
• Polytope conditioning and linear convergence of the Frank-Wolfe algorithm
• Practical graph isomorphism. II.
• The graph isomorphism disease
• The QAP-polytope and the graph isomorphism problem
• Three enhancements for optimization-based bound tightening

This page was built for publication: Graph isomorphism: mixed-integer convex optimization from first-order methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356194)