{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T04:07:10Z","timestamp":1751342830645,"version":"3.41.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1023\/a:1011688823715","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T10:59:33Z","timestamp":1040641173000},"page":"383-395","source":"Crossref","is-referenced-by-count":8,"title":["Robot Map Verification of a Graph World"],"prefix":"10.1007","volume":"5","author":[{"given":"Xiaotie","family":"Deng","sequence":"first","affiliation":[]},{"given":"Evangelos","family":"Milios","sequence":"additional","affiliation":[]},{"given":"Andranik","family":"Mirzaian","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"356218_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1976","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley: Reading, MA, 1976."},{"doi-asserted-by":"crossref","unstructured":"S. Albers and M.R. Henzinger, \u201cExploring unknown environments,\u201d in Proc. of the 29th Annual ACM Symposium on Theory of Computing (STOC'97), 1997, pp. 416\u2013425.","key":"356218_CR2","DOI":"10.1145\/258533.258630"},{"key":"356218_CR3","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R.A. Baeza-Yates","year":"1993","unstructured":"R.A. Baeza-Yates, J.C. Culberson, and G.J.E. Rawlins, \u201cSearching in the plane,\u201d Information and Computation, vol. 106, pp. 234\u2013252, 1993.","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"A. Blum, P. Raghavan, and B. Schieber, \u201cNavigating in unfamiliar geometric terrain,\u201d in Proc. of the 23rd Annual ACM Symposium on Theory of Computing, (STOC'91), 1991, pp. 494\u2013504.","key":"356218_CR4","DOI":"10.1145\/103418.103419"},{"issue":"2","key":"356218_CR5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/274787.274788","volume":"45","author":"X. Deng","year":"1998","unstructured":"X. Deng, T. Kameda, and C.H. Papadimitriou, \u201cHow to learn an unknown environment,\u201d Journal of the ACM, vol. 45(2), pp. 215\u2013245, 1998.","journal-title":"Journal of the ACM"},{"issue":"4","key":"356218_CR6","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1109\/70.508436","volume":"12","author":"X. Deng","year":"1996","unstructured":"X. Deng and A. Mirzaian, \u201cCompetitive robot mapping with homogeneous markers,\u201d IEEE Trans. on Robotics and Automation, vol. 12(4), pp. 532\u2013542, 1996.","journal-title":"IEEE Trans. on Robotics and Automation"},{"doi-asserted-by":"crossref","unstructured":"X. Deng and C.H. Papadimitriou, \u201cExploring an unknown graph,\u201d in Proc. of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS'90), 1990, pp. 355\u2013361.","key":"356218_CR7","DOI":"10.1109\/FSCS.1990.89554"},{"key":"356218_CR8","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1109\/70.105395","volume":"7","author":"G. Dudek","year":"1991","unstructured":"G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, \u201cRobotic exploration as graph construction,\u201d IEEE Trans. on Robotics and Automation, vol. 7, pp. 859\u2013865, 1991.","journal-title":"IEEE Trans. on Robotics and Automation"},{"issue":"2","key":"356218_CR9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0921-8890(97)00030-4","volume":"22","author":"G. Dudek","year":"1997","unstructured":"G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, \u201cMap validation and self-location for a robot with a graph-like map,\u201d Robotics and Autonomous Systems, vol. 22(2), pp. 159\u2013178, 1997.","journal-title":"Robotics and Autonomous Systems"},{"key":"356218_CR10","first-page":"646","volume":"7","author":"J. Edmonds","year":"1960","unstructured":"J. Edmonds, \u201cA combinatorial representation for polyhedral surfaces,\u201d Not. Am. Math. Soc., vol. 7, p. 646, 1960.","journal-title":"Not. Am. Math. Soc."},{"key":"356218_CR11","volume-title":"Topological Graph Theory","author":"J.L. Gross","year":"1987","unstructured":"J.L. Gross and T.W. Tucker, Topological Graph Theory, John Wiley and Sons: New York, 1987."},{"issue":"4","key":"356218_CR12","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1137\/S0097539792233257","volume":"26","author":"L.J. Guibas","year":"1997","unstructured":"L.J. Guibas, R. Motwani, and P. Raghavan, \u201cThe robot localization problem,\u201d SIAM Journal on Computing, vol. 26(4), pp. 1120\u20131138, 1997.","journal-title":"SIAM Journal on Computing"},{"key":"356218_CR13","volume-title":"Pearls in Graph Theory","author":"N. Hartsfield","year":"1990","unstructured":"N. Hartsfield and G. Ringel, Pearls in Graph Theory, Academic Press: New York, 1990."},{"key":"356218_CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0921-8890(91)90014-C","volume":"8","author":"B. Kuipers","year":"1991","unstructured":"B. Kuipers and Y. Byun, \u201cA robot exploration and mapping strategy based on a semantic hierarchy of spatial representatinos,\u201d Robotics and Autonomous Systems, vol. 8, pp. 47\u201363, 1991.","journal-title":"Robotics and Autonomous Systems"},{"doi-asserted-by":"crossref","unstructured":"B. Kuipers and T. Levitt, \u201cNavigation and mapping in large-scale space,\u201d AI Mag., pp. 61\u201374, Summer 1988.","key":"356218_CR15","DOI":"10.2307\/3398016"},{"doi-asserted-by":"crossref","unstructured":"S. Kwek, \u201cOn a simple depth-first search strategy for exploring unknown graphs,\u201d in Proc. of the 6th International Workshop on Algorithms and Data Structures (WADS'97), Halifax, Nova Scotia, Canada, August 6\u20138, 1997, pp. 345\u2013353.","key":"356218_CR16","DOI":"10.1007\/3-540-63307-3_73"},{"key":"356218_CR17","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0004-3702(90)90027-W","volume":"44","author":"T.S. Levitt","year":"1990","unstructured":"T.S. Levitt and D.T. Lawton, \u201cQualitative navigation for mobile robots,\u201d Artificial Intelligence, vol. 44, pp. 305\u2013360, 1990.","journal-title":"Artificial Intelligence"},{"unstructured":"Petrisor Panaite and Andrzej Pelc, \u201cExploring unknown undirected graphs,\u201d in Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98), 1998, pp. 316\u2013322.","key":"356218_CR18"},{"key":"356218_CR19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"C. Papadimitriou","year":"1991","unstructured":"C. Papadimitriou and M. Yannakakis, \u201cShortest paths without a map,\u201d Theoretical Comp. Science, vol. 84, pp. 127\u2013150, 1991.","journal-title":"Theoretical Comp. Science"},{"key":"356218_CR20","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"R.L. Rivest","year":"1993","unstructured":"R.L. Rivest and R.E. Schapire, \u201cInference of finite automata using homing sequences,\u201d Information and Computation, vol. 103, pp. 299\u2013347, 1993.","journal-title":"Information and Computation"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011688823715.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011688823715\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011688823715.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:07:55Z","timestamp":1751281675000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011688823715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["356218"],"URL":"https:\/\/doi.org\/10.1023\/a:1011688823715","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}