当前位置: X-MOL 学术SIAM J. Matrix Anal. Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Bounds on the Spectral Radius of Digraphs from Subgraph Counts
SIAM Journal on Matrix Analysis and Applications ( IF 1.5 ) Pub Date : 2020-01-01 , DOI: 10.1137/19m1256312
Ximing Chen , Masaki Ogura , Victor M. Preciado

The spectral radius of a directed graph is a metric that can only be computed when the structure of the network is completely known. However, in many practical scenarios, it is not possible to exac...

中文翻译:

来自子图计数的有向图谱半径的界限

有向图的谱半径是一个度量,只有当网络的结构完全已知时才能计算。但是,在很多实际场景中,无法精确...
更新日期:2020-01-01
down
wechat
bug