{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:03Z","timestamp":1725893943189},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729044"},{"type":"electronic","value":"9783540729051"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72905-1_35","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T17:47:06Z","timestamp":1187632026000},"page":"391-402","source":"Crossref","is-referenced-by-count":0,"title":["A New k-Graph Partition Algorithm for Distributed P2P Simulation Systems"],"prefix":"10.1007","author":[{"given":"Chunjiang","family":"Wu","sequence":"first","affiliation":[]},{"given":"Shijie","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Linna","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Jiaqing","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Yanli","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiaoqian","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"35_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/1041680.1041681","volume":"36","author":"A.T. Stephanos","year":"2004","unstructured":"Stephanos, A.T., Spinellis, D.: A Survey of Peer-to-Peer Content Distribution Technologies. ACM Computing Surveys\u00a036(4), 335\u2013371 (2004)","journal-title":"ACM Computing Surveys"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Ingalls, R. G.: Introduction to Simulation. In: Proceedings of the 2002 Winter Simulation Conference (WSC 2002) San Diego, California, USA (2002)","DOI":"10.1109\/WSC.2002.1172861"},{"key":"35_CR3","unstructured":"Joseph, S.: An Extendible Open Source P2P Simulator. P2P Journal (2003)"},{"key":"35_CR4","unstructured":"Sedgewick, R.: Algorithms in Java. Parts 1-4, 3rd edn. vol. 1, Tsinghua University Publisher (2004)"},{"key":"35_CR5","unstructured":"Buckly, F., Lewinter, M.: A Friendly Introdution to Graph Theory. 1st edn. Tsinghua University Publisher (2005)"},{"key":"35_CR6","unstructured":"Pilkingtong, J., Baden, S.: Partition With Spacefilling Curves. Technical Report CS94-394, Dept.of Computer Science And Engineering, Univ. of California (1994)"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Hager, W., Krylyuk, Y.: Graph Partition And Continuous Quadratic Programming. SIAM Journal on Discrete Mathematics (1999)","DOI":"10.1137\/S0895480199335829"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Simon, H., Sohn, A., Biswas, R.: HARP: a Fast Spectral Partition. In: Proceedings of 9th ACM Symposium on Parallel Algorithms And Architectures, Newport, Rhode Island(1997)","DOI":"10.1145\/258492.258497"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partition Irregular Graphs. SIAM Journal on Scientific Computing, pp. 359\u2013392 (1998)","DOI":"10.1137\/S1064827595287997"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way Partition Scheme for Irregular Graphs. Journal of Parallel and Distributed Computing (1998)","DOI":"10.1006\/jpdc.1997.1404"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Monien, B., Preis, R., Diekmann, R.: Quality Matching And Local Improvement for Multilevel Graph \u2013 Partition. Technical Report, University of Paderborn (1999)","DOI":"10.1016\/S0167-8191(00)00049-1"},{"key":"35_CR12","unstructured":"Walshaw, C., Cross, M.: Parallel Optimization Algorithms for Multilevel Mesh Partitioning. Technical Report 99\/IM\/44 [A], University of Greenwich, London, UK (1999)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Arora, S., Rao, S., Vazirani. U.: Expander Flows, Geometric Embeddings and Graph Partition. ACM Symposium on Theory of Computing (STOC 2004), Chicago, Illinois, USA (2004)","DOI":"10.1145\/1007352.1007355"},{"key":"35_CR14","unstructured":"Ji, X.: Graph Partition Problems With Minimum Size Constraints. Rensselaer Polytechnic Institute, Troy, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72905-1_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T21:11:24Z","timestamp":1684012284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72905-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729044","9783540729051"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72905-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}