Author:
Bampas Evangelos,Bilò Davide,Drovandi Guido,Gualà Luciano,Klasing Ralf,Proietti Guido
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffman, M., Mihal’ák, M., Ram, S.: Network discovery and verification. IEEE Journal on Selected Areas in Communications 24(12), 2168–2181 (2006)
2. Bejerano, Y., Rastogi, M.: Rubust monitoring of link delays and faults in IP networks. In: 22nd IEEE Int. Conf. on Comp. Comm (INFOCOM 2003), pp. 134–144 (2003)
3. Bilò, D., Erlebach, T., Mihal’ák, M., Widmayer, P.: Discovery of network properties with all-shortest-paths queries. Theoretical Computer Science 411(14-15), 1626–1637 (2010)
4. Bshouty, N.H., Mazzawi, H.: Reconstructing weighted graphs with minimal query complexity. Theoretical Computer Science 412(19), 1782–1790 (2011)
5. Choi, S.-S., Kim, J.H.: Optimal query complexity bounds for finding graphs. Artificial Intelligence 174(9-10), 551–569 (2010)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献