Distance-edge-monitoring sets of networks
From MaRDI portal
Publication:6541036
DOI10.1007/S00236-024-00453-ZMaRDI QIDQ6541036
Gang Yang, Chang-Xiang He, Jiannan Zhou, Yaping Mao
Publication date: 17 May 2024
Published in: Acta Informatica (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Network verification via routing table queries
- Discovery of network properties with all-shortest-paths queries
- The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
- Exploring networks with traceroute-like probes: Theory and simulations
- On the strong distance problems of pyramid networks
- Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
- Data Movement Techniques for the Pyramid Computer
- Fault tolerance properties of pyramid networks
- Monitoring the edges of a graph using distances
Related Items (3)
Monitoring the edges of product networks using distances ⋮ Realizability problem of distance-edge-monitoring numbers ⋮ Fault-tolerance in distance-edge-monitoring sets
This page was built for publication: Distance-edge-monitoring sets of networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541036)
