Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum.
Swati NayakShankar N. UpadhyaySabitha D'SouzaPradeep G. BhatPublished in: Discret. Math. Algorithms Appl. (2023)
Keyphrases
- adjacency matrix
- hamming distance
- edit distance
- graph matching
- subgraph isomorphism
- graph representation
- weighted graph
- directed graph
- binary strings
- distance measure
- pattern matching
- graph partitioning
- graph model
- graph clustering
- undirected graph
- distance function
- similarity measure
- positive definite
- edge weights
- string edit distance
- pairwise
- graph databases
- graph mining
- bipartite graph
- dynamic programming
- object recognition
- feature selection