Discovery of network properties with all-shortest-paths queries-Reference-Cited by-同舟云学术

Discovery of network properties with all-shortest-paths queries

Published:2010-03 Issue:14-15 Volume:411 Page:1626-1637
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Bilò Davide,Erlebach Thomas,Mihalák Matúš,Widmayer Peter

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference15 articles.

1. Route Views Project, University of Oregon. http://www.routeviews.org.

2. DIMES, Mapping the internet. http://www.netdimes.org/.

3. B. Cheswick, Internet mapping project. http://www.cheswick.com/ches/map/. URL http://research.lumeta.com/ches/map/.

4. R. Govindan, H. Tangmunarunkit, Heuristics for internet map discovery, in: Proceedings of the 19th Conference on Computer Communications, IEEE INFOCOM, Tel Aviv, Israel, 2000, pp. 1371–1380. URL citeseer.nj.nec.com/govindan00heuristics.html.

5. Network discovery and verification;Beerliová;IEEE Journal on Selected Areas in Communications (JSAC),2006

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Monitoring the edges of a graph using distances with given girth;Journal of Computer and System Sciences;2024-08

2. Distance-edge-monitoring sets of networks;Acta Informatica;2024-03-19

3. Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity;Lecture Notes in Computer Science;2024

4. Erdös–Gallai-type problems for distance-edge-monitoring numbers;Discrete Applied Mathematics;2024-01

5. On the distance-edge-monitoring numbers of graphs;Discrete Applied Mathematics;2024-01