The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
The Node-to-Node Graph Matching Algorithm Schema
Abstract
Many graph matching algorithms follow the approach of node-similarity measurement, that is, matching graphs by means of comparing the corresponding pairs of nodes of the graphs. Based on this idea, the authors propose a high-level schema for node-to-node graph matching, namely N2N graph matching algorithm schema. The chapter shows that such a N2N graph matching algorithm schema is versatile enough to subsume most of the representative node-to-node based graph matching algorithms. It is also shown that improved algorithms can be derived from this N2N graph matching schema, compared with various corresponding algorithms. In addition, the authors point out the limitation and constraints of the propose algorithm schema and suggest some possible treatments.
Related Content
|
R. N. Ravikumar, S. Aarthi, Valisher Sapayev, Alijon Esanov.
© 2026.
32 pages.
|
|
Md Mehedi Hasan Emon, Tahsina Khan.
© 2026.
34 pages.
|
|
Zerin Tasnim, Md Mahdi Hasan Ahid, Md. Adnan Rahman, Mohammad Mofasserul Islam, Md. Nafis Fuad, Abu Bakar Abdul Hamid.
© 2026.
34 pages.
|
|
P. S. Venkateswaran, S. Jeyakumar, S. Devi Kamatchi, S. Manimaran.
© 2026.
36 pages.
|
|
Aliza, Abdullah, Muhammad Usman.
© 2026.
32 pages.
|
|
Rohit Yadav.
© 2026.
22 pages.
|
|
Salam Al E'mari, Yousef Sanjalawe, Fuad Fataftah.
© 2026.
30 pages.
|
|
|