An algorithm for weighted sub-graph matching based on gradient flows

DOI10.1016/j.ins.2015.12.033zbMath1395.68104OpenAlexW2236339611MaRDI QIDQ1671710

Songqiao Tao, Shuting Wang

Publication date: 7 September 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.12.033

zbMATH Keywords

gradient flowsubgraph matchingweighted adjacency matrix

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Cites Work

• Unnamed Item
• 3D shape retrieval using kernels on extended Reeb graphs
• Graph matching by simplified convex-concave relaxation procedure
• AllDifferent-based filtering for subgraph isomorphism
• Runge-Kutta methods on Lie groups
• Approximation of graph edit distance based on Hausdorff matching
• Inexact graph matching by means of estimation of distribution algorithms
• A dynamical systems approach to weighted graph matching
• Connectivity graphs as models of local interactions
• On convex relaxation of graph isomorphism
• An eigendecomposition approach to weighted graph matching problems
• An Algorithm for Subgraph Isomorphism
• Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
• Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism

This page was built for publication: An algorithm for weighted sub-graph matching based on gradient flows