Graph theoretic foundations of pathfinder networks

DOI10.1016/0898-1221(88)90221-0MaRDI QIDQ1104895zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 52884
• scientific article; zbMATH DE number 1489856
• ``Minimax length links of a dissimilarity matrix and minimum spanning trees
• scientific article; zbMATH DE number 4012654
• scientific article; zbMATH DE number 1302297

Cites work

• scientific article; zbMATH DE number 3644524 (Why is no real title available?)
• scientific article; zbMATH DE number 3660183 (Why is no real title available?)
• scientific article; zbMATH DE number 3711960 (Why is no real title available?)
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 3574784 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• scientific article; zbMATH DE number 3326241 (Why is no real title available?)
• Distance matrix of a graph and its realizability
• Foundations of multidimensional scaling.
• Free trees and bidirectional trees as representations of psychological distance
• Graph theoretic foundations of pathfinder networks
• Hierarchical clustering schemes
• Nonmetric multidimensional scaling. A numerical method
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Parallel concepts in graph theory
• Realizing the distance matrix of a graph
• Representation of structure in similarity data: problems and prospects
• The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II

Cited in

(6)

• Graph graphics: Theory and practice
• Graph theoretic foundations of pathfinder networks
• Connectionist networks qua graphs
• scientific article; zbMATH DE number 52884 (Why is no real title available?)
• Mental models of dynamic systems are different: adjusting for heterogeneous granularity
• ``Minimax length links of a dissimilarity matrix and minimum spanning trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104895)