Child pages
  • MST-Pathfinder Network Scaling

Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.
Comment: Migrated to Confluence 5.3

...

  1. Schvaneveldt, Roger., Durso, Francis., Dearholt, Donald. Graph theoretic foundations of pathfinder networks. In Computers & mathematics with applications, volume 15, pages 337-345, 1988. Link
  2. Schvaneveldt, Roger., Durso, Francis., Dearholt, Donald. Network structures in Proximity Data. 1989. Link
  3. Schvaneveldt, Roger. Pathfinder associative networks : Studies in Knowledge organization. 1990. Link
  4. Guerrero-Bote, Vicente., Zapico-Alonso, Felipe., Espinosa-Calvo, Maria Eugenia., Crisostomo, Rocio Gomez., Moya-Anegnon, Felix. Binary Pathfinder: An improvement to the Pathfinder algorithm. In Information processing & management, volume 42, pages 1484-1490, 2006. Link
  5. Quirin, Arnaud., Cordon, Oscar., Guerrero-Bote, Vicente., Vargas-Quesada, Benjamin., Moya-Anegnon, Felix. A quick MST-based algorithm to obtain Pathfinder networks ((infinity), n - 1). In Journal of the American Society for Information Science and Technology, volume 59, pages 1912-1924, 2008. Link
  6. Quirin, Arnaud., Cordon, Oscar., Santamaria, J., Vargas-Quesada, Benjamin., Moya-Anegnon, Felix. A new variant of the Pathfinder algorithm to generate large visual science maps in cubic time. In Information processing & management, volume 44, pages 1611-1623, 2008. Link
See Also

{:spaces=} {incoming-links}
Wiki Markup
Incoming Links
spaces