Graph simplification and matching using commute times

DOI10.1016/J.PATCOG.2006.11.013MaRDI QIDQ2373488zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Huaijun Qiu, Edwin R. Hancock

Publication date 11 July 2007

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2006.11.013

zbMATH Keywords

commute timegraph simplificationgraph spectrumgraph-matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10)

Recommendations

• Computer Vision - ECCV 2004
• Machine Learning: ECML 2004
• Approximation of graph edit distance in quadratic time
• scientific article; zbMATH DE number 2090203
• A study of graph spectra for comparing graphs and trees

Cites work

• An eigendecomposition approach to weighted graph matching problems
• Computer Vision - ECCV 2004
• Discrete Green's functions
• First-passage properties of the Erdos–Renyi random graph
• scientific article; zbMATH DE number 878897 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Machine Learning: ECML 2004

Cited in

(6)

• Commute times for a directed graph using an asymmetric Laplacian
• A random walk on image patches
• Detecting Commuting Patterns by Clustering Subtrajectories
• Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering
• scientific article; zbMATH DE number 1436000 (Why is no real title available?)
• Machine Learning: ECML 2004

This page was built for publication: Graph simplification and matching using commute times

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