Pages that link to "Item:Q666533"
From MaRDI portal
The following pages link to A convex relaxation bound for subgraph isomorphism (Q666533):
Displaying 5 items.
- A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation (Q2023115) (← links)
- New bounds for subset selection from conic relaxations (Q2076815) (← links)
- On convex relaxation of graph isomorphism (Q2962278) (← links)
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism (Q4575696) (← links)
- Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable (Q5111861) (← links)