Pages that link to "Item:Q743125"
From MaRDI portal
The following pages link to Network verification via routing table queries (Q743125):
Displaying 14 items.
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension (Q4636778) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- Monitoring the edges of a graph using distances (Q5896103) (← links)
- Tracking routes in communication networks (Q5918972) (← 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)
