Optimizing Network Discovery with Clever Walks

Thumbnail Image
Files
Gera_Optimizing_Network_Discovery_2017.pdf (1.33 MB)
Authors
Gera, Ralucca
Juliano, Nicholas R.
Schmitt, Karl R.B.
Advisors
Second Readers
Subjects
Date of Issue
2017-07
Date
Publisher
Association for Computing Machinery (ACM)
Language
Abstract
Problem Definition: Given the current (partial) knowledge of a network, what node should be visited next to reveal the most of the network’s topology?
Type
Article
Description
The article of record as published may be found at http://dx.doi.org/10.1145/3110025.3120961
URI
https://hdl.handle.net/10945/57261
Series/Report No
Department
Applied Mathematics
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Department of Defense (DoD)
National Science Foundation
Funding
Format
8 p.
Citation
Gera, Ralucca, Nicholas R. Juliano, and Karl RB Schmitt. "Optimizing Network Discovery with Clever Walks." In Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, pp. 1217-1224. ACM, 2017.
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections
Publications