Graph theoretic foundations of pathfinder networks

DOI10.1016/0898-1221(88)90221-0zbMath0647.92024OpenAlexW1975409653MaRDI QIDQ1104895

R. W. Schvaneveldt, D. W. Dearholt, F. T. Durso

Publication date: 1988

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(88)90221-0

zbMATH Keywords

dissimilaritymeasurement scaleminimal spanning treescomputing distances in networksinvariance under transformations of dataMinkowski r-metricnetwork adjacency matrixPathfinder networksPFNET properties of inclusionpsychological similarity

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20) Mathematical psychology (91E99)

Related Items (5)

Graph graphics: Theory and practice ⋮ Connectionist networks qua graphs ⋮ Graph theoretic foundations of pathfinder networks ⋮ Mental models of dynamic systems are different: adjusting for heterogeneous granularity ⋮ ``Minimax length links of a dissimilarity matrix and minimum spanning trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Graph theoretic foundations of pathfinder networks
• Representation of structure in similarity data: problems and prospects
• Free trees and bidirectional trees as representations of psychological distance
• Parallel concepts in graph theory
• Hierarchical clustering schemes
• The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
• Nonmetric multidimensional scaling. A numerical method
• Distance matrix of a graph and its realizability
• Realizing the distance matrix of a graph
• Foundations of multidimensional scaling.

This page was built for publication: Graph theoretic foundations of pathfinder networks