Pages that link to "Item:Q910418"
From MaRDI portal
The following pages link to An algorithm and its role in the study of optimal graph realizations of distance matrices (Q910418):
Displaying 12 items.
- Reconstruction of graphs based on random walks (Q837176) (← links)
- A constructive algorithm for realizing a distance matrix (Q858334) (← 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)
- Distance matrices on the \textit{H-join} of graphs: a general result and applications (Q1794312) (← 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)
- New bounds on the distance Laplacian and distance signless Laplacian spectral radii (Q5142111) (← links)
- Composed degree-distance realizations of graphs (Q5918621) (← links)
- Composed degree-distance realizations of graphs (Q5925629) (← links)
- Graph realization of distance sets (Q6633568) (← links)
