1Quirin A, Cord6n A, Guerrero-Bote V P, et al. A quick MST-based algorithm to obtain Pathfinder networks ( w , n - 1 ) [ J ]. Journal of The American Society for Information Science and Technology, 2008, 59(12) :1912-1924.
2Schvaneveldt R W, Durso F T, Dearholt D W. Network structures in proximity data[J]. The Psychology of learning and motivation, 1989, 24:249 - 284.
3Guerrero-Bote V P, Zapico-Alonso F, Espinosa M E, et al. Binary Path- finder: An improvement to the Pathfinder algorithm[ J]. Information Processing and Management, 2006,42 ( 6 ) : 1484 - 1490.
4Quirin A, Cord6n O, Santamarfa J, et al. A new variant of the Pathfind- er algorithm to generate large visual science maps in eubic time [ J ]. Information Processing and Management,2008,44 : 1611 - 1623.
5Quirin A, Cord6n O, Guerrero-Bote V P, et al. A Quick MST-Based Al- gorithm to Obtain Pathfinder Networks( zo ,n - 1 ) [J]. Journal of the American Society for Information Science and Technology, 2008,59 (12) :1912 - 1924.
