Graph matching based on dot product representation of graphs

DOI10.1007/978-3-642-20844-7_18MaRDI QIDQ3003463zbMATH OpenOpenAlexFDO

Authors Jin Tang, Bo Jiang, Bin Luo

Publication date 27 May 2011

Published in Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20844-7_18

zbMATH Keywords

association graphgraph matchingrandom dot product graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The graph matching problem
• scientific article; zbMATH DE number 2090223
• Graph matching with nonnegative sparse model
• A fast projected fixed-point algorithm for large graph matching
• Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis

Cited in

(8)

• Kronecker product graph matching.
• A fast projected fixed-point algorithm for large graph matching
• Combinatorial and matrix methods for graph matching
• Data graph formulation as the minimum-weight maximum-entropy problem
• Graph unification and matching
• Graph-Based Representations in Pattern Recognition
• Structural, Syntactic, and Statistical Pattern Recognition
• Modeling graphs using dot product representations

This page was built for publication: Graph matching based on dot product representation of graphs

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