A convex relaxation bound for subgraph isomorphism
DOI10.1155/2012/908356zbMATH Open1236.05133OpenAlexW1966242563WikidataQ58703379 ScholiaQ58703379MaRDI QIDQ666533FDOQ666533
Authors: Christian Schellewald 
Publication date: 8 March 2012
Published in: International Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/908356
Recommendations
Combinatorial optimization (90C27) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- CSDP 2.3 user's guide
- CSDP, A C library for semidefinite programming
- Benchmarks for Optimization Software
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithm for Subgraph Isomorphism
- Title not available (Why is that?)
- A distance measure between attributed relational graphs for pattern recognition
- Title not available (Why is that?)
- An Interior-Point Method for Semidefinite Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Maxima for Graphs and a New Proof of a Theorem of Turán
- An independent benchmarking of SDP and SOCP solvers
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Quadratic programming with one negative eigenvalue is NP-hard
- Title not available (Why is that?)
- Subgraph Isomorphism in Planar Graphs and Related Problems
- Exact bounds on the order of the maximum clique of a graph.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subgraph isomorphism, matching relational structures and maximal cliques
- Graph-Based Representations in Pattern Recognition
Cited In (6)
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism
- Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
- A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation
- New bounds for subset selection from conic relaxations
- On convex relaxation of graph isomorphism
- A Bound for Non-subgraph Isomorphism
Uses Software
This page was built for publication: A convex relaxation bound for subgraph isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666533)
