Graph simplification and matching using commute times

DOI10.1016/j.patcog.2006.11.013zbMath1132.68510OpenAlexW2150217673WikidataQ60431201 ScholiaQ60431201MaRDI QIDQ2373488

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

graph spectrumcommute timegraph simplificationgraph-matching

Mathematics Subject Classification ID

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

Related Items

Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering

Cites Work

• Unnamed Item
• Unnamed Item
• Discrete Green's functions
• An eigendecomposition approach to weighted graph matching problems
• First-passage properties of the Erdos–Renyi random graph
• Machine Learning: ECML 2004
• Computer Vision - ECCV 2004