乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:46:14Z","timestamp":1725543974115},"publisher-location":"Berlin, Heidelberg","reference-count":32,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11476-2_15","type":"book-chapter","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T06:15:31Z","timestamp":1264400131000},"page":"182-194","source":"Crossref","is-referenced-by-count":14,"title":["Black Hole Search in Directed Graphs"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Dobrev","sequence":"additional","affiliation":[]},{"given":"Rastislav","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]},{"given":"Stanislav","family":"Mikl\u00edk","sequence":"additional","affiliation":[]},{"given":"Dana","family":"Pardubsk\u00e1","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"The Theory of Search Games and Rendezvous","author":"S. Alpern","year":"2003","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer, Dordrecht (2003)"},{"key":"15_CR2","unstructured":"Arkin, E., Bender, M., Fekete, S., Mitchell, J.: The freeze-tag problem: how to wake up a swarm of robots. In: 13 th ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 568\u2013577 (2002)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Barriere, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proc. 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA 2002), pp. 200\u2013209 (2002)","DOI":"10.1145\/564870.564906"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Slonim, D.: The power of team exploration: Two robots can learn unlabeled directed graphs. In: 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), pp. 75\u201385 (1994)","DOI":"10.1109\/SFCS.1994.365703"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Bender, M., Slonim, D.K.: The power of team exploration: two robots can learn unlabeled directed graphs. In: Proc. 35th Symp. on Foundations of Computer Science (FOCS 1994), pp. 75\u201385 (1994)","DOI":"10.1109\/SFCS.1994.365703"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Fern\u00e1ndez, A., Ron, D., Sahai, A., Vadhan, S.P.: The power of a pebble: Exploring and mapping directed graphs. In: STOC, pp. 269\u2013278 (1998)","DOI":"10.1145\/276698.276759"},{"key":"15_CR7","first-page":"661","volume":"11","author":"L. Budach","year":"1975","unstructured":"Budach, L.: On the solution of the labyrinth problem for finite automata. Elektronische Informationsverarbeitung und Kybernetic\u00a011, 661\u2013672 (1975)","journal-title":"Elektronische Informationsverarbeitung und Kybernetic"},{"key":"15_CR8","doi-asserted-by":"crossref","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) (2008)","DOI":"10.1145\/1383369.1383373"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11516798_5","volume-title":"Principles of Distributed Systems","author":"J. Czyzowicz","year":"2005","unstructured":"Czyzowicz, J., Kowalski, D., Markou, E., Pelc, A.: Searching for a black hole in tree networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol.\u00a03544, pp. 67\u201380. Springer, Heidelberg (2005)"},{"key":"#cr-split#-15_CR10.1","doi-asserted-by":"crossref","unstructured":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. In: Proceedings: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, October 22\u201324, vol.\u00a01, pp. 355\u2013361 (1990);","DOI":"10.1109\/FSCS.1990.89554"},{"key":"#cr-split#-15_CR10.2","unstructured":"Formerly called the Annual Symposium on Switching and Automata Theory. IEEE catalog number 90CH29256. Computer Society order no. 2082"},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/net.20095","volume":"47","author":"S. Dobrev","year":"2006","unstructured":"Dobrev, S., Flocchini, P., Kralovic, R., Prencipe, G., Ruzicka, P., Santoro, N.: Optimal search for a black hole in common interconnection networks. Networks\u00a047(2), 61\u201371 (2006)","journal-title":"Networks"},{"key":"15_CR12","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 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 153\u2013162 (2002)","DOI":"10.1145\/571850.571853"},{"key":"15_CR13","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 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 153\u2013162 (2002)","DOI":"10.1145\/571850.571853"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-27860-3_6","volume-title":"Principles of Distributed Systems","author":"S. Dobrev","year":"2004","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Multiple agents rendezvous in a ring in spite of a black hole. In: Papatriantafilou, M., Hunel, P. (eds.) OPODIS 2003. LNCS, vol.\u00a03144, pp. 34\u201346. Springer, Heidelberg (2004)"},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00453-006-1232-z","volume":"48","author":"S. Dobrev","year":"2007","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica\u00a048(1), 67\u201390 (2007)","journal-title":"Algorithmica"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-27796-5_11","volume-title":"Structural Information and Communication Complexity","author":"S. Dobrev","year":"2004","unstructured":"Dobrev, S., Flocchini, P., Santoro, N.: Improved bounds for optimal black hole search in a network with a map. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 111\u2013122. Springer, Heidelberg (2004)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45068-8_54","volume-title":"Web Engineering","author":"O. Esparza","year":"2003","unstructured":"Esparza, O., Soriano, M., Munoz, J., Forne, J.: Host revocation authority: A way of protecting mobile agents from malicious hosts. In: Cueva Lovelle, J.M., Rodr\u00edguez, B.M.G., Gayo, J.E.L., Ruiz, M.d.P.P., Aguilar, L.J. (eds.) ICWE 2003. LNCS, vol.\u00a02722. Springer, Heidelberg (2003)"},{"issue":"3","key":"15_CR18","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/net.20127","volume":"48","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Gasieniec, L., Kowalski, D.R., Pelc, A.: Collective tree exploration. Networks\u00a048(3), 166\u2013177 (2006)","journal-title":"Networks"},{"key":"15_CR19","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)"},{"issue":"2-3","key":"15_CR20","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. Theor. Comput. Sci.\u00a0345(2-3), 331\u2013344 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"15_CR21","doi-asserted-by":"publisher","first-page":"2310","DOI":"10.1016\/j.dam.2007.11.001","volume":"156","author":"P. Fraigniaud","year":"2008","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Impact of memory size on graph exploration capability. Discrete Applied Mathematics\u00a0156(12), 2310\u20132319 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"11","key":"15_CR22","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1016\/j.ic.2008.07.005","volume":"206","author":"P. Fraigniaud","year":"2008","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with advice. Inf. Comput.\u00a0206(11), 1276\u20131287 (2008)","journal-title":"Inf. Comput."},{"key":"15_CR23","first-page":"585","volume-title":"SODA","author":"L. Gasieniec","year":"2007","unstructured":"Gasieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 585\u2013594. SIAM, Philadelphia (2007)"},{"issue":"7","key":"15_CR24","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/35.689634","volume":"36","author":"M. Greenberg","year":"1998","unstructured":"Greenberg, M., Byington, J., Harper, D.G.: Mobile agents and security. IEEE Commun. Mag.\u00a036(7), 76\u201385 (1998)","journal-title":"IEEE Commun. Mag."},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-10854-8_47","volume-title":"Fundamentals of Computation Theory","author":"F. Hoffmann","year":"1981","unstructured":"Hoffmann, F.: One pebble does not suffice to search plane labyrinths. In: Gecseg, F. (ed.) FCT 1981. LNCS, vol.\u00a0117, pp. 433\u2013444. Springer, Heidelberg (1981)"},{"issue":"2","key":"15_CR26","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0004-3702(99)00107-1","volume":"117","author":"N.R. Jennings","year":"2000","unstructured":"Jennings, N.R.: On agent-based software engineering. Artificial Intelligence\u00a0117(2), 277\u2013296 (2000)","journal-title":"Artificial Intelligence"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11429647_17","volume-title":"Structural Information and Communication Complexity","author":"R. Klasing","year":"2005","unstructured":"Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Hardness and approximation results for black hole search in arbitrary graphs. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 200\u2013215. Springer, Heidelberg (2005)"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11549345_24","volume-title":"Mathematical Foundations of Computer Science 2005","author":"G.D. Marco","year":"2005","unstructured":"Marco, G.D., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 271\u2013282. Springer, Heidelberg (2005)"},{"issue":"12","key":"15_CR29","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1016\/S0140-3664(99)00083-3","volume":"22","author":"R. Oppliger","year":"1999","unstructured":"Oppliger, R.: Security issues related to mobile code and agent-based systems. Computer Communications\u00a022(12), 1165\u20131170 (1999)","journal-title":"Computer Communications"},{"key":"15_CR30","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"},{"key":"15_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-68671-1_4","volume-title":"Mobile Agents and Security","author":"T. Sander","year":"1998","unstructured":"Sander, T., Tschudin, C.F.: Protecting mobile agents against malicious hosts. In: Vigna, G. (ed.) Mobile Agents and Security. LNCS, vol.\u00a01419, pp. 44\u201360. Springer, Heidelberg (1998)"}],"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-11476-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T09:35:33Z","timestamp":1558776933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11476-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114755","9783642114762"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11476-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}