Node matching computation between two large graphs in linear computational cost

DOI10.1007/978-3-319-58961-9_13MaRDI QIDQ5082148zbMATH OpenOpenAlexFDO

Authors Pep Santacruz, Shaima Algabli, F. Serratosa

Publication date 15 June 2022

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-319-58961-9_13

zbMATH Keywords

bipartite graph matchinggraph edit distancelarge graph matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Social networks; opinion dynamics (91D30)

Recommendations

• A fast projected fixed-point algorithm for large graph matching
• Matching graphs with unique node labels
• Approximate matching of neighborhood subgraphs -- an ordered string graph Levenshtein method
• Incremental graph pattern matching
• Algorithms for approximate graph matching

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Improving the Hungarian assignment algorithm
• Structural pattern recognition with graph edit distance. Approximation algorithms and applications

Cited in

(3)

• Iterative node matching between complex networks
• ONE-TO-MANY NODE MATCHING BETWEEN COMPLEX NETWORKS
• Approximate matching of neighborhood subgraphs -- an ordered string graph Levenshtein method

This page was built for publication: Node matching computation between two large graphs in linear computational cost

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