Probabilistic Subgraph Matching Based on Convex Relaxation
- 1 January 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 171-186
- https://doi.org/10.1007/11585978_12
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Graphical models for graph matching: Approximate models and optimal algorithmsPattern Recognition Letters, 2005
- Graph edit distance from spectral seriationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- Kronecker product graph matchingPattern Recognition, 2003
- Many-to-Many Matching of Scale-Space Feature Hierarchies Using Metric EmbeddingLecture Notes in Computer Science, 2003
- Dominant sets and hierarchical clusteringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Structural graph matching using the EM algorithm and singular value decompositionIeee Transactions On Pattern Analysis and Machine Intelligence, 2001
- Graph matching with a dual-step EM algorithmIEEE Transactions on Pattern Analysis and Machine Intelligence, 1998
- Inexact graph matching using genetic searchPattern Recognition, 1997
- An eigendecomposition approach to weighted graph matching problemsIeee Transactions On Pattern Analysis and Machine Intelligence, 1988
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976