Pages that link to "Item:Q858334"
From MaRDI portal
The following pages link to A constructive algorithm for realizing a distance matrix (Q858334):
Displaying 16 items.
- Injective optimal realizations of finite metric spaces (Q418856) (← links)
- Modeling graphs using dot product representations (Q626245) (← links)
- Reconstruction of graphs based on random walks (Q837176) (← links)
- An algorithm and its role in the study of optimal graph realizations of distance matrices (Q910418) (← links)
- Underlying graph and total length of optimal realizations of variable distance matrices (Q1095929) (← links)
- Methods for constructing distance matrices and the inverse eigenvalue problem (Q1124929) (← links)
- Distance realization problems with applications to internet tomography (Q1604199) (← links)
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem (Q1752190) (← links)
- Searching for realizations of finite metric spaces in tight spans (Q1799387) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- Vertex-weighted graphs: realizable and unrealizable domains (Q2154111) (← links)
- Distance spectra of graphs: a survey (Q2250935) (← links)
- (Q4035079) (← links)
- Composed degree-distance realizations of graphs (Q5918621) (← links)
- Composed degree-distance realizations of graphs (Q5925629) (← links)
- Graph realization of distance sets (Q6633568) (← links)