Spread Centrality： a novel method for quantifying node importance in dynamic graph networks

doi:10.3969/j.issn.1002-2279.2026.04.006

GAO Xuepan, YAO Sai, LUO Meng, JIA Qingchao, SHE Yunxiang, LIANG Yibo, YANG Jiabei, ZHAI Lizhi

MICROPROCESSORS ›› 2026, Vol. 47 ›› Issue (4) : 39-48.

PDF(2316 KB)

MICROPROCESSORS ›› 2026, Vol. 47 ›› Issue (4) : 39-48. DOI: 10.3969/j.issn.1002-2279.2026.04.006

Spread Centrality： a novel method for quantifying node importance in dynamic graph networks

{{article.zuoZhe_EN}}

Author information +

History +

HeighLight

Abstract

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations

{{article.zuoZheEn_L}}. {{article.title_en}}[J]. {{journal.qiKanMingCheng_EN}}, 2026, 47(4): 39-48 https://doi.org/10.3969/j.issn.1002-2279.2026.04.006

References

List( Publishing order | Descend order by publishing year | Descend order by cited within ) Chart analysis

References

Funding

RIGHTS & PERMISSIONS

PDF(2316 KB)

Accesses

Citation

Detail

Sections

Recommended

Received	Published
2025-07-09	2026-08-31
Issue Date
2026-09-15

Please choose a citation manager

Content to export