Pages that link to "Item:Q962167"
From MaRDI portal
The following pages link to Discovery of network properties with all-shortest-paths queries (Q962167):
Displaying 11 items.
- Network verification via routing table queries (Q743125) (← links)
- Optimal path discovery problem with homogeneous knowledge (Q2300623) (← links)
- Monitoring the edges of a graph using distances (Q5896103) (← links)
- Monitoring the edges of a graph using distances with given girth (Q6126478) (← links)
- On the distance-edge-monitoring numbers of graphs (Q6184320) (← links)
- Erdös-Gallai-type problems for distance-edge-monitoring numbers (Q6184335) (← links)
- Distance-edge-monitoring sets of networks (Q6541036) (← links)
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity (Q6547818) (← links)
- Perturbation results for distance-edge-monitoring numbers (Q6593703) (← links)
- Monitoring the edges of product networks using distances (Q6655674) (← links)
- Realizability problem of distance-edge-monitoring numbers (Q6658853) (← links)