Efficient Algorithms for Citation Network Analysis
<|reference_start|>Efficient Algorithms for Citation Network Analysis: 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.<|reference_end|>
@article{batagelj2003efficient,
    title={Efficient Algorithms for Citation Network Analysis},
    author={Vladimir Batagelj (University of Ljubljana, Slovenia)},
    journal={inside the book: V. Batagelj, P. Doreian, A. Ferligoj, N.
  Kej\v{z}ar: Understanding Large Temporal Networks and Spatial Networks.
  Wiley, 2014. ISBN: 978-0-470-71452-2},
    year={2003},
    number={IMFM 897},
    archivePrefix={arXiv},
    eprint={cs/0309023},
    primaryClass={cs.DL cs.DM cs.DS}
}