{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:04Z","timestamp":1759638064305},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_12","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T10:02:01Z","timestamp":1133776921000},"page":"127-138","source":"Crossref","is-referenced-by-count":12,"title":["Network Discovery and Verification"],"prefix":"10.1007","author":[{"given":"Zuzana","family":"Beerliova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Eberhard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Erlebach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Hall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mat\u00fa\u0161","family":"Miha\u013e\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. Shankar","family":"Ram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Sudan, M.: Improved low-degree testing and its applications. In: Proc. 29th Ann. ACM Symp. on Theory of Computing (STOC 1997), pp. 485\u2013495 (1997)","DOI":"10.1145\/258533.258642"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Barford, P., Bestavros, A., Byers, J., Crovella, M.: On the marginal utility of deploying measurement infrastructure. In: Proc. ACM SIGCOMM Internet Measurement Workshop 2001 (November 2001)","DOI":"10.1145\/505202.505204"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Slonim, D.K.: The power of team exploration: Two robots can learn unlabeled directed graphs. In: Proc. 35th Ann. IEEE Symp. on Foundations of Computer Science (FOCS 1994), pp. 75\u201385 (1994)","DOI":"10.1109\/SFCS.1994.365703"},{"key":"12_CR4","unstructured":"C\u00e1ceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L., Seara, C., Wood, D.R.: On the metric dimension of Cartesian products of graphs (2005) (Manuscript)"},{"key":"12_CR5","first-page":"47","volume":"160","author":"G. Chartrand","year":"2003","unstructured":"Chartrand, G., Zhang, P.: The theory and applications of resolvability in graphs: A survey. Congr. Numer.\u00a0160, 47\u201368 (2003)","journal-title":"Congr. Numer."},{"key":"12_CR6","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.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.\u00a0H. Freeman and Company, New York (1979)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-44676-1_13","volume-title":"Algorithms - ESA 2001","author":"B.V. Halld\u00f3rsson","year":"2001","unstructured":"Halld\u00f3rsson, B.V., Halld\u00f3rsson, M.M., Ravi, R.: On the approximability of the minimum test collection problem. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 158\u2013169. Springer, Heidelberg (2001)"},{"key":"12_CR8","first-page":"191","volume":"2","author":"F. Harary","year":"1976","unstructured":"Harary, F., Melter, R.: The metric dimension of a graph. Ars Combin.\u00a02, 191\u2013195 (1976)","journal-title":"Ars Combin."},{"key":"12_CR9","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 Appl. Math.\u00a070, 217\u2013229 (1996)","journal-title":"Discrete Appl. Math."},{"key":"12_CR10","first-page":"195","volume":"9","author":"B. Lindstr\u00f6m","year":"1964","unstructured":"Lindstr\u00f6m, B.: On a combinatory detection problem I. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl.\u00a09, 195\u2013207 (1964)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1155\/S0161171204311403","volume":"38","author":"V. Saenpholphat","year":"2004","unstructured":"Saenpholphat, V., Zhang, P.: Conditional resolvability in graphs: A survey. Int. J. Math. Math. Sci.\u00a038, 1997\u20132017 (2004)","journal-title":"Int. J. Math. Math. Sci."},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1287\/moor.1030.0070","volume":"29","author":"A. Seb\u0151","year":"2004","unstructured":"Seb\u0151, A., Tannier, E.: On metric generators of graphs. Math. Oper. Res.\u00a029(2), 383\u2013393 (2004)","journal-title":"Math. Oper. Res."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Subramanian, L., Agarwal, S., Rexford, J., Katz, R.: Characterizing the Internet hierarchy from multiple vantage points. In: INFOCOM 2002 (June 2002)","DOI":"10.1109\/INFCOM.2002.1019307"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:04:16Z","timestamp":1619492656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11604686_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}