Login / Signup
On the difference between proximity and other distance parameters in triangle-free graphs and C4-free graphs.
Peter Dankelmann
Sonwabile Mafunda
Published in:
Discret. Appl. Math. (2022)
Keyphrases
</>
proximity measures
random walk
graph matching
graph theoretic
graph theory
series parallel
complex structures
graph model
graph structure
parameter values
markov random field
parameter settings
euclidean distance
graph partitioning
graph representation
distance function
parameter estimation
maximum likelihood