Efficient Algorithms for Citation Network Analysis
数字图书馆
2015-05-07 v1 离散数学
数据结构与算法
摘要
In the paper very efficient, linear in number of arcs, algorithms for determining Hummon and Doreian's arc weights SPLC and SPNP in citation network are proposed, and some theoretical properties of these weights are presented. The nonacyclicity problem in citation networks is discussed. An approach to identify on the basis of arc weights an important small subnetwork is proposed and illustrated on the citation networks of SOM (self organizing maps) literature and US patents.
引用
@article{arxiv.cs/0309023,
title = {Efficient Algorithms for Citation Network Analysis},
author = {Vladimir Batagelj},
journal= {arXiv preprint arXiv:cs/0309023},
year = {2015}
}