{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:54:14Z","timestamp":1742914454527,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222115"},{"type":"electronic","value":"9783642222122"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22212-2_24","type":"book-chapter","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T07:22:50Z","timestamp":1311232970000},"page":"270-281","source":"Crossref","is-referenced-by-count":2,"title":["Network Verification via Routing Table Queries"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Bampas","sequence":"first","affiliation":[]},{"given":"Davide","family":"Bil\u00f2","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Drovandi","sequence":"additional","affiliation":[]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"12","key":"24_CR1","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","volume":"24","author":"Z. Beerliova","year":"2006","unstructured":"Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffman, M., Mihal\u2019\u00e1k, M., Ram, S.: Network discovery and verification. IEEE Journal on Selected Areas in Communications\u00a024(12), 2168\u20132181 (2006)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013144 (2003)","DOI":"10.1109\/INFCOM.2003.1208666"},{"issue":"14-15","key":"24_CR3","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1016\/j.tcs.2010.01.010","volume":"411","author":"D. Bil\u00f2","year":"2010","unstructured":"Bil\u00f2, D., Erlebach, T., Mihal\u2019\u00e1k, M., Widmayer, P.: Discovery of network properties with all-shortest-paths queries. Theoretical Computer Science\u00a0411(14-15), 1626\u20131637 (2010)","journal-title":"Theoretical Computer Science"},{"issue":"19","key":"24_CR4","doi-asserted-by":"publisher","first-page":"1782","DOI":"10.1016\/j.tcs.2010.12.055","volume":"412","author":"N.H. Bshouty","year":"2011","unstructured":"Bshouty, N.H., Mazzawi, H.: Reconstructing weighted graphs with minimal query complexity. Theoretical Computer Science\u00a0412(19), 1782\u20131790 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"9-10","key":"24_CR5","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/j.artint.2010.02.003","volume":"174","author":"S.-S. Choi","year":"2010","unstructured":"Choi, S.-S., Kim, J.H.: Optimal query complexity bounds for finding graphs. Artificial Intelligence\u00a0174(9-10), 551\u2013569 (2010)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.tcs.2005.12.009","volume":"355","author":"L. Dall\u2019Asta","year":"2006","unstructured":"Dall\u2019Asta, L., Alvarez-Hamelin, J.I., Barrat, A., V\u00e1zquez, A., Vespignani, A.: Exploring networks with traceroute-like probes: Theory and simulations. Theoretical Computer Science\u00a0355(1), 6\u201324 (2006)","journal-title":"Theoretical Computer Science"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-74871-7_8","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"T. Erlebach","year":"2007","unstructured":"Erlebach, T., Hall, A., Mihal\u2019\u00e1k, M.: Approximate Discovery of Random Graphs. In: Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., Nunkesser, M., Widmayer, P. (eds.) SAGA 2007. LNCS, vol.\u00a04665, pp. 82\u201392. Springer, Heidelberg (2007)"},{"key":"24_CR8","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Govindan, R., Tangmunarunkit, H.: Heuristics for Internet map discovery. In: 19th IEEE Int. Conf. on Comp. Comm (INFOCOM 2000), pp. 1371\u20131380 (2000)","DOI":"10.1109\/INFCOM.2000.832534"},{"key":"24_CR10","first-page":"43","volume":"3","author":"S. Gravier","year":"2008","unstructured":"Gravier, S., Klasing, R., Moncel, J.: Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs. Algorithmic Operations Research\u00a03, 43\u201350 (2008)","journal-title":"Algorithmic Operations Research"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica\u00a020, 374\u2013387 (1998)","journal-title":"Algorithmica"},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4153\/CMB-1963-001-x","volume":"6","author":"F. Harary","year":"1963","unstructured":"Harary, F.: A characterization of block graphs. Canad. Math. Bull.\u00a06(1), 1\u20136 (1963)","journal-title":"Canad. Math. Bull."},{"key":"24_CR13","unstructured":"Harary, F., Melter, R.: The metric dimension of a graph. Ars Combinatoria, 191\u2013195 (1976)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discrete Applied Mathematics\u00a070, 217\u2013229 (1996)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ipl.2007.02.001","volume":"103","author":"J. Suomela","year":"2007","unstructured":"Suomela, J.: Approximability of identifying codes and locating-dominating codes. Information Processing Letters\u00a0103(1), 28\u201333 (2007)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22212-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T07:14:29Z","timestamp":1741331669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22212-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222115","9783642222122"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22212-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}