{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T15:03:11Z","timestamp":1750950191915,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642246494"},{"type":"electronic","value":"9783642246500"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24650-0_22","type":"book-chapter","created":{"date-parts":[[2011,10,22]],"date-time":"2011-10-22T14:08:55Z","timestamp":1319292535000},"page":"258-269","source":"Crossref","is-referenced-by-count":4,"title":["Parallel Implementations of Gusfield\u2019s Cut Tree Algorithm"],"prefix":"10.1007","author":[{"given":"Jaime","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz A.","family":"Rodrigues","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabiano","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato","family":"Carmo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9 L. P.","family":"Guedes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Elias P.","family":"Duarte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys.\u00a074(1), 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"22_CR2","volume-title":"Proceedings of the 16th int\u2019l conference on World Wide Web. WWW 2007","author":"L. Backstrom","year":"2007","unstructured":"Backstrom, L., Dwork, C., Kleinberg, J.: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In: Proceedings of the 16th int\u2019l conference on World Wide Web. WWW 2007. ACM, NY (2007)"},{"key":"22_CR3","unstructured":"Bader, D.A., Sachdeva, V.: A cache-aware parallel implementation of the push-relabel network flow algorithm and experimental evaluation of the gap relabeling heuristic. In: ISCA PDCS (2005)"},{"key":"22_CR4","unstructured":"Batagelj, V., Mrvar, A.: Pajek datasets (2006), http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/"},{"key":"22_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"22_CR6","volume-title":"Using OpenMP: portable shared memory parallel programming","author":"B. Chapman","year":"2008","unstructured":"Chapman, B., Jost, G., Van der Pas, R.: Using OpenMP: portable shared memory parallel programming. MIT Press, Cambridge (2008)"},{"key":"22_CR7","unstructured":"Chekuri, C.S., Goldberg, A.V., Karger, D.R., Levine, M.S., Stein, C.: Experimental study of minimum cut algorithms. In: SODA \u201997: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. pp. 324\u2013333. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1997)"},{"issue":"4","key":"22_CR8","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"B.V. Cherkassky","year":"1997","unstructured":"Cherkassky, B.V., Goldberg, A.V.: On Implementing the Push-Relabel Method for the Maximum Flow Problem. Algorithmica\u00a019(4), 390\u2013410 (1997)","journal-title":"Algorithmica"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph clustering and minimum cut trees. Internet Mathematics 1(4) (2003)","DOI":"10.1080\/15427951.2004.10129093"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM\u00a045, 783\u2013797 (1998)","journal-title":"J. ACM"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM\u00a035, 921\u2013940 (1988)","journal-title":"J. ACM"},{"key":"22_CR12","volume-title":"SODA 1999: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"A.V. Goldberg","year":"1999","unstructured":"Goldberg, A.V., Tsioutsiouliklis, K.: Cut tree algorithms. In: SODA 1999: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, USA (1999)"},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics\u00a09(4), 551\u2013570 (1961)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-03367-4_30","volume-title":"Algorithms and Data Structures","author":"R. G\u00f6rke","year":"2009","unstructured":"G\u00f6rke, R., Hartmann, T., Wagner, D.: Dynamic Graph Clustering Using Minimum-Cut Trees. In: Dehne, F., Gavrilova, M., Sack, J.R., T\u00f3th, C. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 339\u2013350. Springer, Heidelberg (2009)"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/0219009","volume":"19","author":"D. Gusfield","year":"1990","unstructured":"Gusfield, D.: Very simple methods for all pairs network flow analysis. SIAM J. Comput.\u00a019, 143\u2013155 (1990)","journal-title":"SIAM J. Comput."},{"key":"22_CR16","unstructured":"Hong, B., He, Z.: An asynchronous multi-threaded algorithm for the maximum network flow problem with non-blocking global relabeling heuristic. IEEE Transactions on Parallel and Distributed Systems 99 (2010)"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. In: ACM Trans. on Knowledge Discovery from Data, ACM TKDD (2007)","DOI":"10.1145\/1217299.1217301"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Letchford, A., Reinelt, G., Theis, D.: Odd minimum cut-sets and b-matchings revisited. SIAM Journal on Discrete Mathematics 22(4) (2008)","DOI":"10.1137\/060664793"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Mitrofanova, A., Farach-Colton, M., Mishra, B.: Efficient and robust prediction algorithms for protein complexes using gomory-hu trees. In: Altman, R.B., Dunker, A.K., Hunter, L., Murray, T., Klein, T.E. (eds.) Pacific Symposium on Biocomputing, pp. 215\u2013226 (2009)","DOI":"10.1142\/9789812836939_0021"},{"key":"22_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721649","volume-title":"Algorithmic Aspects of Graph Connectivity","author":"H. Nagamochi","year":"2008","unstructured":"Nagamochi, H., Ibaraki, T.: Algorithmic Aspects of Graph Connectivity. Cambridge University Press, New York (2008)"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1109\/TC.1979.1675348","volume":"28","author":"G. Rao","year":"1979","unstructured":"Rao, G., Stone, H., Hu, T.: Assignment of tasks in a distributed processor system with limited memory. IEEE Transactions on Computers\u00a028, 291\u2013299 (1979)","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"22_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/S0097539792251730","volume":"24","author":"H. Saran","year":"1995","unstructured":"Saran, H., Vazirani, V.V.: Finding k cuts within twice the optimal. SIAM J. Comput.\u00a024(1), 101\u2013108 (1995)","journal-title":"SIAM J. Comput."},{"issue":"10","key":"22_CR23","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1002\/prot.22741","volume":"78","author":"N. Tuncbag","year":"2010","unstructured":"Tuncbag, N., Salman, F.S., Keskin, O., Gursoy, A.: Analysis and network representation of hotspots in protein interfaces using minimum cut trees. Proteins: Structure, Function, and Bioinformatics\u00a078(10), 2283\u20132294 (2010)","journal-title":"Proteins: Structure, Function, and Bioinformatics"},{"issue":"6684","key":"22_CR24","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 dynamics of \u2019small-world\u2019 networks. Nature\u00a0393(6684), 440\u2013442 (1998)","journal-title":"Nature"}],"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-642-24650-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T05:51:10Z","timestamp":1741845070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24650-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642246494","9783642246500"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24650-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}