Node Matching Computation Between Two Large Graphs in Linear Computational Cost

DOI10.1007/978-3-319-58961-9_13zbMath1489.68205OpenAlexW2612340705MaRDI QIDQ5082148

Shaima Algabli, Pep Santacruz, Francesc 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

graph edit distancebipartite graph matchinglarge graph matching

Mathematics Subject Classification ID

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

Cites Work

• Structural pattern recognition with graph edit distance. Approximation algorithms and applications
• Improving the Hungarian assignment algorithm
• Unnamed Item
• Unnamed Item

This page was built for publication: Node Matching Computation Between Two Large Graphs in Linear Computational Cost