On the evaluation of graph centrality for shape matching

DOI10.1007/978-3-642-38221-5_22MaRDI QIDQ4922165zbMATH OpenOpenAlexFDO

Authors Samuel de Sousa, Nicole M. Artner, Walter G. Kropatsch

Publication date 28 May 2013

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-38221-5_22

zbMATH Keywords

centralitygraphshape matching

Mathematics Subject Classification ID

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

Recommendations

• Centrality measure in graphs
• Fast approximation of centrality
• On the influence of node centralities on graph edit distance for graph classification
• Fast Approximation of Centrality
• Graph Based Shapes Representation and Recognition

Cited in

(1)

• Graph-based point drift: graph centrality on the registration of point-sets

This page was built for publication: On the evaluation of graph centrality for shape matching

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