Inexact multisubgraph matching using graph eigenspace and clustering models

DOI10.1007/3-540-70659-3_13MaRDI QIDQ4808936zbMATH OpenFDO

Authors Serhiy Kosinov, T. Caelli

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2396/23960133.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Recommendations

• Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
• Inexact graph matching using a hierarchy of matching processes
• A spectral-multiplicity-tolerant approach to robust graph matching
• Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity
• Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds

Cited in

(7)

• A long trip in the charming world of graphs for pattern recognition
• Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
• Weighted graph-matching using modal clusters
• Computer Vision - ECCV 2004
• Matching graphs with unique node labels
• A spectral-multiplicity-tolerant approach to robust graph matching
• A study of graph spectra for comparing graphs and trees

This page was built for publication: Inexact multisubgraph matching using graph eigenspace and clustering models

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