Graph theoretic foundations of pathfinder networks

DOI10.1016/0898-1221(88)90221-0zbMATH Open0647.92024OpenAlexW1975409653MaRDI QIDQ1104895FDOQ1104895

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

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

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)

Cites Work

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

Cited In (6)

• Graph graphics: Theory and practice
• Graph theoretic foundations of pathfinder networks
• Connectionist networks qua graphs
• Title not available (Why is that?)
• 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)