{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:49Z","timestamp":1725475009354},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_44","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T05:57:35Z","timestamp":1164779855000},"page":"429-438","source":"Crossref","is-referenced-by-count":2,"title":["Analyzing Disturbed Diffusion on Networks"],"prefix":"10.1007","author":[{"given":"Henning","family":"Meyerhenke","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033265","volume-title":"Foundations of Coding","author":"J. Ad\u00e1mek","year":"1991","unstructured":"Ad\u00e1mek, J.: Foundations of Coding. J.\u00a0Wiley & Sons, Chichester (1991)"},{"key":"44_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. J.\u00a0Wiley & Sons, Chichester (2000)","edition":"2"},{"key":"44_CR3","volume-title":"Algebraic Graph Theory","author":"N. Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1993)"},{"issue":"21","key":"44_CR4","doi-asserted-by":"publisher","first-page":"7426","DOI":"10.1073\/pnas.0500334102","volume":"102","author":"R.R. Coifman","year":"2005","unstructured":"Coifman, R.R., Lafon, S., Lee, A.B., Maggioni, M., Nadler, B., Warner, F., Zucker, S.W.: Geometric diffusions as a tool for harmonic analysis and structure definition of data. Parts I and II. Proc. Natl. Academy of Sciences\u00a0102(21), 7426\u20137437 (2005)","journal-title":"Proc. Natl. Academy of Sciences"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","volume":"7","author":"G. Cybenko","year":"1989","unstructured":"Cybenko, G.: Dynamic load balancing for distributed memory multiprocessors. Parallel and Distributed Computing\u00a07, 279\u2013301 (1989)","journal-title":"Parallel and Distributed Computing"},{"issue":"7","key":"44_CR6","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/S0167-8191(99)00018-6","volume":"25","author":"R. Diekmann","year":"1999","unstructured":"Diekmann, R., Frommer, A., Monien, B.: Efficient schemes for nearest neighbor load balancing. Parallel Computing\u00a025(7), 789\u2013812 (1999)","journal-title":"Parallel Computing"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Doyle, P.G., Snell, J.L.: Random Walks and Electric Networks. Math. Assoc. of America (1984)","DOI":"10.5948\/UPO9781614440222"},{"key":"44_CR8","unstructured":"Ellis, R.B.: Discrete green\u2019s functions for products of regular graphs. In: AMS National Conference, invited talk, special session on Graph Theory (2001)"},{"key":"44_CR9","volume-title":"Probability and Random Processes","author":"G.R. Grimmett","year":"1992","unstructured":"Grimmett, G.R., Stirzaker, D.R.: Probability and Random Processes, 2nd edn. Oxford University Press, Oxford (1992)","edition":"2"},{"volume-title":"Handbook of Graph Theory","year":"2004","key":"44_CR10","unstructured":"Gross, J.L., Yellen, J. (eds.): Handbook of Graph Theory. CRC Press, Boca Raton (2004)"},{"issue":"4","key":"44_CR11","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/S0167-8191(99)00002-2","volume":"25","author":"Y.F. Hu","year":"1999","unstructured":"Hu, Y.F., Blake, R.F.: An improved diffusion algorithm for dynamic load balancing. Parallel Computing\u00a025(4), 417\u2013444 (1999)","journal-title":"Parallel Computing"},{"key":"44_CR12","volume-title":"Finite Markov Chains","author":"J.G. Kemeny","year":"1976","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Heidelberg (1976)"},{"key":"44_CR13","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Francisco (1992)"},{"issue":"2","key":"44_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S.P. Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in PCM. IEEE Transactions on Information Theory\u00a028(2), 129\u2013136 (1982)","journal-title":"IEEE Transactions on Information Theory"},{"key":"44_CR15","first-page":"1","volume":"2","author":"L. Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: A survey. Combinatorics, Paul Erd\u00f6s is Eighty\u00a02, 1\u201346 (1993)","journal-title":"Combinatorics, Paul Erd\u00f6s is Eighty"},{"key":"44_CR16","unstructured":"Meila, M., Shi, J.: A random walks view of spectral segmentation. In: Eighth International Workshop on Artificial Intelligence and Statistics (AISTATS) (2001)"},{"key":"44_CR17","first-page":"57","volume-title":"Proc. 20th IEEE Intl. Parallel and Distributed Processing Symp. (IPDPS 2006)","author":"H. Meyerhenke","year":"2006","unstructured":"Meyerhenke, H., Monien, B., Schamberger, S.: Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid. In: Proc. 20th IEEE Intl. Parallel and Distributed Processing Symp (IPDPS 2006), p. 57 (CD). IEEE, Los Alamitos (2006)"},{"key":"44_CR18","unstructured":"Nadler, B., Lafon, S., Coifman, R.R., Kevrekidis, I.G.: Diffusion maps, spectral clustering and eigenfunctions of fokker-planck operators. In: NIPS (2005)"},{"key":"44_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-30115-8_35","volume-title":"Machine Learning: ECML 2004","author":"M. Saerens","year":"2004","unstructured":"Saerens, M., Dupont, P., Fouss, F., Yen, L.: The principal components analysis of a graph, and its relationships to spectral clustering. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol.\u00a03201, pp. 371\u2013383. Springer, Heidelberg (2004)"},{"key":"44_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/11535294_23","volume-title":"Parallel Computing Technologies","author":"S. Schamberger","year":"2005","unstructured":"Schamberger, S.: A shape optimizing load distribution heuristic for parallel adaptive FEM computations. In: Malyshkin, V.E. (ed.) PaCT 2005. LNCS, vol.\u00a03606, pp. 263\u2013277. Springer, Heidelberg (2005)"},{"key":"44_CR21","unstructured":"Shewchuk, J.R.: An introduction to the conjugate gradient method without the agonizing pain. Technical Report CMU-CS-94-125, Carnegie Mellon University (1994)"},{"key":"44_CR22","unstructured":"The\u00a0BlueGene\/L Team. An overview of the BlueGene\/L supercomputer. In: Proc. ACM\/IEEE Conf. on Supercomputing, pp. 1\u201322 (2002)"},{"key":"44_CR23","doi-asserted-by":"crossref","unstructured":"Tishby, N., Slonim, N.: Data clustering by markovian relaxation and the information bottleneck method. In: NIPS, pp. 640\u2013646 (2000)","DOI":"10.1145\/345508.345578"},{"key":"44_CR24","volume-title":"Multigrid","author":"U. Trottenberg","year":"2000","unstructured":"Trottenberg, U., Oosterlee, C.W., Sch\u00fcller, A.: Multigrid. Academic Press, London (2000)"},{"key":"44_CR25","unstructured":"van Dongen, S.: Graph Clustering by Flow Simulation. PhD thesis, Univ. of Utrecht (2000)"},{"key":"44_CR26","volume-title":"Load Balancing in Parallel Computers","author":"C. Xu","year":"1997","unstructured":"Xu, C., Lau, F.C.M.: Load Balancing in Parallel Computers. Kluwer, Dordrecht (1997)"},{"key":"44_CR27","unstructured":"Yen, L., Vanvyve, D., Wouters, F., Fouss, F., Verleysen, M., Saerens, M.: Clustering using a random-walk based distance measure. In: ESANN 2005, European Symposium on Artificial Neural Networks (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:18Z","timestamp":1605643218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11940128_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}