Pages that link to "Item:Q3798690"
From MaRDI portal
The following pages link to The structure of distances in networks (Q3798690):
Displaying 16 items.
- Distance-sum heterogeneity in graphs and complex networks (Q450259) (← links)
- Comparison of mean distance in superposed networks (Q793635) (← links)
- On optimal embeddings of metrics in graphs (Q794666) (← links)
- Submatrices of non-tree-realizable distance matrices (Q1163034) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- A canonical decomposition theory for metrics on a finite set (Q1190163) (← links)
- A unified approach to fuzzy pattern recognition (Q1278520) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- Distance distributions for graphs modeling computer networks (Q2462402) (← links)
- Distance Queries in Large-Scale Fully Dynamic Complex Networks (Q2819495) (← links)
- (Q2974193) (← links)
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices (Q3320428) (← links)
- (Q4018893) (← links)
- SCALING OF INTERNODE DISTANCES IN WEIGHTED COMPLEX NETWORKS (Q4929678) (← links)
- (Q5288797) (← links)
- Modeling Network Populations via Graph Distances (Q5881982) (← links)