乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:46:09Z","timestamp":1725543969732},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114755"},{"type":"electronic","value":"9783642114762"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11476-2_14","type":"book-chapter","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T01:15:31Z","timestamp":1264382131000},"page":"167-181","source":"Crossref","is-referenced-by-count":3,"title":["More Efficient Periodic Traversal in Anonymous Undirected Graphs"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Dobrev","sequence":"additional","affiliation":[]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[]},{"given":"David","family":"Ilcinkas","sequence":"additional","affiliation":[]},{"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"Ioannis","family":"Lignos","sequence":"additional","affiliation":[]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/mana.19780860120","volume":"86","author":"Lothar Budach","year":"1978","unstructured":"Budach, L.: Automata and labyrinths. Mathematische Nachrichten, 195\u2013282 (1978)","journal-title":"Mathematische Nachrichten"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/11429647_12","volume-title":"Structural Information and Communication Complexity","author":"S. Dobrev","year":"2005","unstructured":"Dobrev, S., Jansson, J., Sadakane, K., Sung, W.K.: Finding short right-hand-on-the-wall walks in graphs. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 127\u2013139. Springer, Heidelberg (2005)"},{"issue":"5","key":"14_CR3","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1016\/j.jcss.2007.09.004","volume":"74","author":"L. G\u0105sieniec","year":"2008","unstructured":"G\u0105sieniec, L., Klasing, R., Martin, R., Navarra, A., Zhang, X.: Fast periodic graph exploration with constant memory. J. Computer and System Science\u00a074(5), 808\u2013822 (2008)","journal-title":"J. Computer and System Science"},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1145\/1383369.1383373","volume":"4","author":"R. Cohen","year":"2008","unstructured":"Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. ACM Transactions on Algorithms\u00a04(4), 331\u2013344 (2008)","journal-title":"ACM Transactions on Algorithms"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF00288647","volume":"13","author":"H. Rollik","year":"1980","unstructured":"Rollik, H.: Automaten in planaren graphen. Acta Informatica\u00a013, 287\u2013298 (1980)","journal-title":"Acta Informatica"},{"key":"14_CR6","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 J. Computing\u00a029, 1164\u20131188 (2000)","journal-title":"SIAM J. Computing"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3081","volume":"176","author":"M. Bender","year":"2002","unstructured":"Bender, M., Fernandez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: Exploring and mapping directed graphs. Information and Computation\u00a0176(1), 1\u201321 (2002)","journal-title":"Information and Computation"},{"key":"14_CR8","unstructured":"Bender, M., Slonim, D.K.: The power of team exploration: two robots can learn unlabeled directed graphs. In: Proc. 35th Annual Symposium on Foundations of Computer Science (FOCS), pp. 75\u201385 (1994)"},{"issue":"3","key":"14_CR9","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. J. Graph Theory\u00a032(3), 265\u2013297 (1999)","journal-title":"J. Graph Theory"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/11561071_4","volume-title":"Algorithms \u2013 ESA 2005","author":"Rudolf Fleischer","year":"2005","unstructured":"Fleischer, R., Trippen, G.: Exploring an unknown graph efficiently. In: Proc. 13th Annual European Symposium on Algorithms (ESA), pp. 11\u201322 (2005)"},{"issue":"2","key":"14_CR11","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., Rivest, R., Singh, M.: Piecemeal graph exploration by a mobile robot. Information and Computation\u00a0152(2), 155\u2013172 (1999)","journal-title":"Information and Computation"},{"issue":"2-3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF00993411","volume":"18","author":"M. Betke","year":"1995","unstructured":"Betke, M., Rivest, R., Singh, M.: Piecemeal learning of an unknown environment. Machine Learning\u00a018(2-3), 231\u2013254 (1995)","journal-title":"Machine Learning"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1145\/1159892.1159897","volume":"2","author":"C. Duncan","year":"2006","unstructured":"Duncan, C., Kobourov, S., Kumar, V.: Optimal constrained graph exploration. ACM Transaction on Algorithms\u00a02(3), 380\u2013402 (2006)","journal-title":"ACM Transaction on Algorithms"},{"issue":"2-3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.tcs.2005.07.014","volume":"345","author":"P. Fraigniaud","year":"2005","unstructured":"Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. Theoretical Computer Science\u00a0345(2-3), 331\u2013344 (2005)","journal-title":"Theoretical Computer Science"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11685654_1","volume-title":"Theoretical Computer Science","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Ilcinkas, D., Rajsbaum, S., Tixeuil, S.: The reduced automata technique for graph exploration space lower bounds. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Theoretical Computer Science. LNCS, vol.\u00a03895, pp. 1\u201326. Springer, Heidelberg (2006)"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1006\/jagm.1999.1043","volume":"33","author":"P. Panaite","year":"1999","unstructured":"Panaite, P., Pelc, A.: Exploring unknown undirected graphs. J. Algorithms\u00a033, 281\u2013295 (1999)","journal-title":"J. Algorithms"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1137\/0209048","volume":"9","author":"S.A. Cook","year":"1980","unstructured":"Cook, S.A., Rackoff, C.: Space lower bounds for maze threadability on restricted machines. SIAM J. Computing\u00a09(3), 636\u2013652 (1980)","journal-title":"SIAM J. Computing"},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M. Garey","year":"1976","unstructured":"Garey, M., Johnson, D., Tarjan, R.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Computing\u00a05(4), 704\u2013714 (1976)","journal-title":"SIAM J. Computing"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.03.035","volume":"401","author":"D. Ilcinkas","year":"2008","unstructured":"Ilcinkas, D.: Setting port numbers for fast graph exploration. Theoretical Computer Science\u00a0401, 236\u2013242 (2008)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11476-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:22:16Z","timestamp":1558272136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11476-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114755","9783642114762"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11476-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}