Login / Signup
A characterization of well-indumatchable graphs having girth greater than seven.
Arthur S. Finbow
Bert L. Hartnell
Michael D. Plummer
Published in:
Discret. Appl. Math. (2022)
Keyphrases
</>
graph matching
structured objects
adjacency matrix
graph theoretic
graph representation
graph mining
artificial intelligence
directed graph
graph model
bipartite graph
graph theoretical
graph theory
database
multiscale
bayesian networks
computer vision
databases