Revision as of 08:44, 4 September 2017 edit KolbertBot (talk \| contribs) Bots 1,166,042 edits m Bot: HTTP→HTTPS ← Previous edit		Revision as of 16:41, 5 September 2017 edit undo 73.99.89.73 (talk) B-D-F-I-M-K -> B-D-F-I-M-N ; D-F-I-M-K -> D-F-I-M-N Next edit →
Line 23: ==== Search path link count (SPLC) ==== A link’s SPLC is the number of times the link is traversed if one runs through all possible paths from all the ancestors of the tail node (including itself) to all the sinks. SPLC is first proposed by Hummon and Doreian.<ref name=":0" /> Figure 2 presents the SPLC values for each link in the same citation network as shown in Figure 1. Six paths traverse through the link (D, F) thus give it the SPLC value 6. They are: B-D-F-H-K, B-D-F-I-L, B-D-F-I-M-KN, D-F-H-K, D-F-I-L, and D-F-I-M-KN, noting that all the paths begin either from the ancestor of D, which is B, and D itself. ==== Search path node pair (SPNP) ====

Main path analysis: Difference between revisions