A Convex Relaxation Bound for Subgraph Isomorphism
Work
Year: 2012
Type: article
Abstract: In this work a convex relaxation of a subgraph isomorphism problem is proposed, which leads to a new lower bound that can provide a proof that a subgraph isomorphism between two graphs can not be foun... more
Author Christian Schellewald
Cites: 27
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold