Efficient Algorithms for Citation Network Analysis

Computer Science – Digital Libraries

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Efficient Algorithms for Citation Network Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Algorithms for Citation Network Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Algorithms for Citation Network Analysis will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-160916

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.