Local metric dimension for graphs with small clique numbers.

Gholamreza Abrishami Michael A. Henning Mostafa Tavakoli

Published in: Discret. Math. (2022)

Keyphrases

maximum common subgraph
graph matching
small number
independent set
maximum clique
distance measure
directed graph
neural network
bipartite graph
graph theory
heavy tails
subgraph isomorphism
high dimension
similarity metric
graph mining
graph structure
evaluation metrics
lower bound
similarity measure