期刊
PATTERN RECOGNITION LETTERS
卷 125, 期 -, 页码 295-302出版社
ELSEVIER
DOI: 10.1016/j.patrec.2019.05.008
关键词
Correlated Bernoulli random graphs; Alignment strength; Graph correlation; Graph matchability; Complexity of graph matching
资金
- Air Force Research Laboratory
- DARPA [FA8750-18-2-0035, FA8750-17-2-0112]
When two graphs have a correlated Bernoulli distribution, we prove that the alignment strength of their natural bijection strongly converges to a novel measure of graph correlation. rho(T) that neatly combines intergraph with intragraph distribution parameters. Within broad families of the random graph parameter settings, we illustrate that exact graph matching runtime and also matchability are both functions of. rho(T), with thresholding behavior starkly illustrated in matchability. (C) 2019 The Authors. Published by Elsevier B.V.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据