The structure of distances in networks

DOI10.1002/net.3230160109zbMath0653.05044OpenAlexW1969009033MaRDI QIDQ3798690

Eric C. Howe, Charles R. Johnson, James F. Lawrence

Publication date: 1986

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230160109

zbMATH Keywords

graphsextreme raysdistance matrixcone of shortest distance matrices

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory to circuits and networks (94C15)

Related Items (7)

Application of cut polyhedra. I ⋮ Submatrices of non-tree-realizable distance matrices ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ A canonical decomposition theory for metrics on a finite set ⋮ A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices ⋮ A unified approach to fuzzy pattern recognition ⋮ On optimal embeddings of metrics in graphs

Cites Work

• On the Extreme Rays of the Metric Cone
• Information Bounds Are Weak in the Shortest Distance Problem
• Unnamed Item

This page was built for publication: The structure of distances in networks