乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:21:35Z","timestamp":1725895295394},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642313455"},{"type":"electronic","value":"9783642313462"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31346-2_69","type":"book-chapter","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T02:42:07Z","timestamp":1342838527000},"page":"615-623","source":"Crossref","is-referenced-by-count":0,"title":["The High Degree Seeking Algorithms with k Steps for Complex Networks"],"prefix":"10.1007","author":[{"given":"Minyu","family":"Feng","sequence":"first","affiliation":[]},{"given":"Hong","family":"Qu","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Xing","family":"Ke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"69_CR1","doi-asserted-by":"crossref","unstructured":"Milgram, S.: The small world problem. Psycholoy Today\u00a060\u201367 (May 1967)","DOI":"10.1037\/e400002009-005"},{"issue":"6684","key":"69_CR2","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamic of \u2019small-world\u2019 networks. Nature\u00a0393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"69_CR3","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0375-9601(99)00757-4","volume":"263","author":"M.E.J. Newman","year":"1999","unstructured":"Newman, M.E.J., Watts, D.J.: Renormalization group analysis of the small-world network model. Phys. Lett. A\u00a0263, 341\u2013346 (1999)","journal-title":"Phys. Lett. A"},{"issue":"5439","key":"69_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barabasi","year":"1999","unstructured":"Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"69_CR5","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1038\/35022643","volume":"406","author":"J. Kleinberg","year":"2000","unstructured":"Kleinberg, J.: Navigation in a small world. Nature\u00a0406, 845 (2000)","journal-title":"Nature"},{"key":"69_CR6","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1126\/science.1070120","volume":"296","author":"D.J. Watts","year":"2002","unstructured":"Watts, D.J., Dodds, P.S., Newman, M.E.J.: Identity and search in social networks. Science\u00a0296, 1302\u20131305 (2002)","journal-title":"Science"},{"issue":"5","key":"69_CR7","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1209\/epl\/i2004-10422-0","volume":"69","author":"K. Sneppen","year":"2005","unstructured":"Sneppen, K., Trusina, A., Rosvall, M.: Hide-and-seek on complex networks. Europhys. Lett.\u00a069(5), 853\u2013859 (2005)","journal-title":"Europhys. Lett."},{"key":"69_CR8","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1016\/j.physa.2008.11.011","volume":"388","author":"E. Estradaa","year":"2009","unstructured":"Estradaa, E., Highamb, D.J., Hatanoc, N.: Communicability betweenness in complex networks. Physica A\u00a0388, 764\u2013774 (2009)","journal-title":"Physica A"},{"key":"69_CR9","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537892.001.0001","volume-title":"Random Walks and Random Environments","author":"B.D. Hughes","year":"1996","unstructured":"Hughes, B.D.: Random Walks and Random Environments. Clarendon Press, Oxford (1996)"},{"key":"69_CR10","doi-asserted-by":"crossref","first-page":"041108","DOI":"10.1103\/PhysRevE.63.041108","volume":"63","author":"F. Jasch","year":"2001","unstructured":"Jasch, F., Blumen, A.: Target problem on small-world networks. Phys. Rev. E\u00a063, 041108 (2001)","journal-title":"Phys. Rev. E"},{"key":"69_CR11","doi-asserted-by":"crossref","first-page":"046135","DOI":"10.1103\/PhysRevE.64.046135","volume":"64","author":"L.A. Adamic","year":"2001","unstructured":"Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in power-law networks. Phys. Rev. E\u00a064, 046135 (2001)","journal-title":"Phys. Rev. E"},{"key":"69_CR12","doi-asserted-by":"crossref","unstructured":"Adamic, L.A., Lukose, R.M., Huberman, B.A.: Local search in unstructured networks. In: Bornholdt, S., Schuster, H.G. (eds.) Handbook of Graphs and Networks. Wiley-VCH, Berlin (2003)","DOI":"10.1002\/3527602755.ch13"},{"key":"69_CR13","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1088\/1367-2630\/9\/6\/190","volume":"9","author":"H.P. Thadakamalla","year":"2007","unstructured":"Thadakamalla, H.P., Albert, R., Kumara, S.R.T.: Search in spatial scale-free networks. New Journal of Physics\u00a09, 190 (2007)","journal-title":"New Journal of Physics"},{"key":"69_CR14","doi-asserted-by":"crossref","first-page":"046126","DOI":"10.1103\/PhysRevE.68.046126","volume":"68","author":"A. Fronczak","year":"2003","unstructured":"Fronczak, A., Fronczak, P., Holyst, J.A.: Mean-field theory for clustering coefficients in Barabasi-Albert network. Phys. Rev. E\u00a068, 046126 (2003)","journal-title":"Phys. Rev. E"},{"key":"69_CR15","doi-asserted-by":"crossref","first-page":"058701","DOI":"10.1103\/PhysRevLett.90.058701","volume":"90","author":"R. Cohen","year":"2003","unstructured":"Cohen, R., Havlin, S.: Scale-free networks are ultrasmall. Phys. Rev. Lett\u00a090, 058701 (2003)","journal-title":"Phys. Rev. Lett"},{"key":"69_CR16","doi-asserted-by":"publisher","first-page":"4633","DOI":"10.1103\/PhysRevLett.85.4633","volume":"85","author":"S.N. Dorogovtsev","year":"2002","unstructured":"Dorogovtsev, S.N., Mendes, J.F.F., Samukhin, A.N.: Structure of growing networks with preferential linking. Phys. Rev. Lett.\u00a085, 4633\u20134636 (2002)","journal-title":"Phys. Rev. Lett."},{"key":"69_CR17","doi-asserted-by":"publisher","first-page":"4629","DOI":"10.1103\/PhysRevLett.85.4629","volume":"85","author":"P.L. Krapivsky","year":"2000","unstructured":"Krapivsky, P.L., Redner, S., Leyvraz, F.: Connectivity of growing random networks. Phys. Rev. Lett.\u00a085, 4629\u20134632 (2000)","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"69_CR18","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M. Rosvall","year":"2008","unstructured":"Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. PNAS\u00a0105(4), 1123 (2008)","journal-title":"PNAS"},{"key":"69_CR19","doi-asserted-by":"crossref","first-page":"027103","DOI":"10.1103\/PhysRevE.65.027103","volume":"65","author":"B.J. Kim","year":"2002","unstructured":"Kim, B.J., Yoon, C.N., Han, S.K., Jeong, H.: Path finding strategies in scale-free networks. Phys. Rev. E\u00a065, 027103 (2002)","journal-title":"Phys. Rev. E"}],"container-title":["Lecture Notes in Computer Science","Advances in Neural Networks \u2013 ISNN 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31346-2_69","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T10:06:51Z","timestamp":1714212411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31346-2_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642313455","9783642313462"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31346-2_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}