乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:31Z","timestamp":1725559171428},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260523"},{"type":"electronic","value":"9783540320739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11429647_12","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:18:25Z","timestamp":1279045105000},"page":"127-139","source":"Crossref","is-referenced-by-count":14,"title":["Finding Short Right-Hand-on-the-Wall Walks in Graphs"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S. Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM Journal on Computing\u00a029, 1164\u20131188 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"1-2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(90)90125-V","volume":"27","author":"N. Alon","year":"1990","unstructured":"Alon, N., Azar, Y., Ravid, Y.: Universal sequences for complete graphs. Discrete Appl. Math.\u00a027(1-2), 25\u201328 (1990)","journal-title":"Discrete Appl. Math."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/inco.1999.2795","volume":"152","author":"B. Awerbuch","year":"1999","unstructured":"Awerbuch, B., Betke, M., Singh, M.: Piecemeal graph learning by a mobile robot. Information and Computation\u00a0152, 155\u2013172 (1999)","journal-title":"Information and Computation"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/0218018","volume":"18","author":"A. Bar-Noy","year":"1989","unstructured":"Bar-Noy, A., Borodin, A., Karchmer, M., Linial, N., Werman, M.: Bounds on universal sequences. SIAM J. Comput.\u00a018, 268\u2013277 (1989)","journal-title":"SIAM J. Comput."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bender, M., Fernandez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: Exploring and mapping directed graphs. In: Proc. of STOC 1998, pp. 269\u2013287 (1998)","DOI":"10.1145\/276698.276759"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Bender, M., Slonim, D.K.: The power of team exploration: two robots can learn unlabeled directed graphs. In: Proc. of FOCS 1994, pp. 75\u201385 (1994)","DOI":"10.1109\/SFCS.1994.365703"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/S0097539791194931","volume":"26","author":"A. Blum","year":"1997","unstructured":"Blum, A., Raghavan, P., Schieber, B.: Navigating in unfamiliar geometric terrain. SIAM Journal on Computing\u00a026, 110\u2013137 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Blum, M., Kozen, D.: On the power of the compass (or, why mazes are easier to search than graphs). In: Proc. of FOCS 1978, pp. 132\u2013142 (1978)","DOI":"10.1109\/SFCS.1978.30"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Budach, L.: Automata and labyrinths. Math. Nachrichten, 195\u2013282 (1978)","DOI":"10.1002\/mana.19780860120"},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/320211.320232","volume":"46","author":"H. Buhrman","year":"1999","unstructured":"Buhrman, H., Franklin, M., Garay, J.A., Hoepman, J.-H., Tromp, J., Vit\u00e1nyi, P.: Mutual search. J. ACM\u00a046(4), 517\u2013536 (1999)","journal-title":"J. ACM"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/274787.274788","volume":"45","author":"X. Deng","year":"1998","unstructured":"Deng, X., Kameda, T., Papadimitriou, C.H.: How to learn an unknown environment i: The rectilinear case. Journal of the ACM\u00a045, 215\u2013245 (1998)","journal-title":"Journal of the ACM"},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","volume":"32","author":"X. Deng","year":"1999","unstructured":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. Journal of Graph Theory\u00a032(3), 265\u2013297 (1999)","journal-title":"Journal of Graph Theory"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-45749-6_35","volume-title":"Algorithms - ESA 2002","author":"A. Dessmark","year":"2002","unstructured":"Dessmark, A., Pelc, A.: Optimal graph exploration without good maps. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 374\u2013386. Springer, Heidelberg (2002)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","volume":"51","author":"K. Diks","year":"2004","unstructured":"Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree exploration with little memory. Journal of Algorithms\u00a051, 38\u201363 (2004)","journal-title":"Journal of Algorithms"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Finding a black hole in an arbitrary network: optimal mobile agents protocols. In: Proc. of PODC 2002, pp. 153\u2013162 (2002)","DOI":"10.1145\/571850.571853"},{"key":"12_CR16","unstructured":"Duncan, C.A., Kobourov, S.G., Kumar, V.S.A.: Optimal constrained graph exploration. In: 12th ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 807\u2013814 (2001)"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0020-0190(97)00091-4","volume":"63","author":"P. Flocchini","year":"1997","unstructured":"Flocchini, P., Mans, B., Santoro, N.: On the impact of sense of direction on communication complexity. Information Processing Letters\u00a063(1), 23\u201331 (1997)","journal-title":"Information Processing Letters"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<165::AID-NET1>3.0.CO;2-I","volume":"32","author":"P. Flocchini","year":"1998","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Sense of direction: definition, properties and classes. Networks\u00a032(3), 165\u2013180 (1998)","journal-title":"Networks"},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s004460100058","volume":"14","author":"P. Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C., Mans, B.: Interval routing schemes allow broadcasting with linear message-complexity. Journal of Distributed Computing\u00a014(4), 217\u2013229 (2001)","journal-title":"Journal of Distributed Computing"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-24749-4_22","volume-title":"STACS 2004","author":"P. Fraigniaud","year":"2004","unstructured":"Fraigniaud, P., Ilcinkas, D.: Digraph exploration with little memory. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 246\u2013257. Springer, Heidelberg (2004)"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-28629-5_34","volume-title":"Mathematical Foundations of Computer Science 2004","author":"P. Fraigniaud","year":"2004","unstructured":"Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 451\u2013462. Springer, Heidelberg (2004)"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/rsa.3240060106","volume":"6","author":"U. Friege","year":"1995","unstructured":"Friege, U.: A tight upper bound on the cover time for random walks on graphs. Random Structures and Algorithms\u00a06(1), 51\u201354 (1995)","journal-title":"Random Structures and Algorithms"},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(93)90199-J","volume":"46","author":"S. Hoory","year":"1993","unstructured":"Hoory, S., Wigderson, A.: Universal traversal sequences for expander graphs. Inf. Process. Lett.\u00a046(2), 67\u201369 (1993)","journal-title":"Inf. Process. Lett."},{"key":"12_CR24","unstructured":"Kozen, D.: Automata and planar graphs. In: Proc. of Fundations Computatial Theory (FCT 1979), pp. 243\u2013254 (1979)"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Panaite, P., Pelc, A.: Impact of topographic information on graph exploration efficiency. Networks\u00a036","DOI":"10.1002\/1097-0037(200009)36:2<96::AID-NET4>3.0.CO;2-N"},{"key":"12_CR26","unstructured":"Rabin, M.O.: Maze threading automata. Technical Report Seminar Talk, University of California at Berkeley (October 1967)"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected st-connectivity in log-space. Electronic Colloquium on Computational Complexity\u00a094 (2004)","DOI":"10.1145\/1060590.1060647"},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF00288647","volume":"13","author":"H.A. Rollik","year":"1980","unstructured":"Rollik, H.A.: Automaten in planaren graphen. Acta Informatica\u00a013, 287\u2013298 (1980)","journal-title":"Acta Informatica"},{"key":"12_CR29","unstructured":"Roo, N., Hareti, S., Shi, W., Iyengar, S.: Robot navigation in unknown terrains: Introductory survey of length, non-heuristic algorithms. Technical Report ORNL\/TM12410, Oak Ridge National Lab (1993)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11429647_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:57:16Z","timestamp":1605643036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11429647_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260523","9783540320739"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11429647_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}