• Corpus ID: 245877240

Inexact Graph Matching Using Centrality Measures

  title={Inexact Graph Matching Using Centrality Measures},
  author={Shriya Dwivedi},
Graph matching is the process of computing the similarity between two graphs. Depending on the requirement, it can be exact or inexact. Exact graph matching requires a strict correspondence between nodes of two graphs, whereas inexact matching allows some flexibility or tolerance during the graph matching. In this chapter, we describe an approximate inexact graph matching by reducing the size of the graphs using different centrality measures. Experimental evaluation shows that it can reduce… 

Figures from this paper



Error-Tolerant Geometric Graph Similarity

The vertex distance (dissimilarity) and edge distance between two graphs are defined and combined to compute graph distance and an approach to error-tolerant graph similarity using geometric graphs is presented.

Error-tolerant graph matching using node contraction

Error-tolerant geometric graph similarity and matching

Error-tolerant graph matching using homeomorphism

  • S. DwivediRavi Shankar Singh
  • Mathematics
    2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI)
  • 2017
A new approach to error-tolerant matching is presented using graph homeomorphism to measure the structural resemblance of two graphs.

Error-Tolerant Graph Matching: A Formal Framework and Algorithms

Some new optimal algorithms for error-tolerant graph matching are discussed, and under specific conditions, the new algorithms may be significantly more efficient than traditional methods.

Geometric graph matching and similarity: a probabilistic approach

This paper proposes a novel density function that estimates the similarity between the vertices of different graphs and shows that this approach outperforms existing graph matching algorithms in terms of matching quality, runtime, and memory consumption.

Reactive Tabu Search for Measuring Graph Similarity

This paper addresses the problem of computing this generic similarity measure and describes two algorithms: a greedy algorithm that quickly computes sub-optimal solutions, and a reactive Tabu search algorithm that may improve these solutions.