{"publication":"LATIN'98: Theoretical Informatics","author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"first_name":"Gabriel Terán","full_name":"Martinez, Gabriel Terán","last_name":"Martinez"}],"doi":"10.1007/bfb0054332","status":"public","place":"Berlin, Heidelberg","year":"1998","citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” In <i>LATIN’98: Theoretical Informatics</i>. Berlin, Heidelberg, 1998. <a href=\"https://doi.org/10.1007/bfb0054332\">https://doi.org/10.1007/bfb0054332</a>.","short":"F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.","ieee":"F. Meyer auf der Heide and G. T. Martinez, “Communication-efficient parallel multiway and approximate minimum cut computation,” in <i>LATIN’98: Theoretical Informatics</i>, Berlin, Heidelberg, 1998.","bibtex":"@inbook{Meyer auf der Heide_Martinez_1998, place={Berlin, Heidelberg}, title={Communication-efficient parallel multiway and approximate minimum cut computation}, DOI={<a href=\"https://doi.org/10.1007/bfb0054332\">10.1007/bfb0054332</a>}, booktitle={LATIN’98: Theoretical Informatics}, author={Meyer auf der Heide, Friedhelm and Martinez, Gabriel Terán}, year={1998} }","mla":"Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” <i>LATIN’98: Theoretical Informatics</i>, 1998, doi:<a href=\"https://doi.org/10.1007/bfb0054332\">10.1007/bfb0054332</a>.","ama":"Meyer auf der Heide F, Martinez GT. Communication-efficient parallel multiway and approximate minimum cut computation. In: <i>LATIN’98: Theoretical Informatics</i>. Berlin, Heidelberg; 1998. doi:<a href=\"https://doi.org/10.1007/bfb0054332\">10.1007/bfb0054332</a>","apa":"Meyer auf der Heide, F., &#38; Martinez, G. T. (1998). Communication-efficient parallel multiway and approximate minimum cut computation. In <i>LATIN’98: Theoretical Informatics</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0054332\">https://doi.org/10.1007/bfb0054332</a>"},"_id":"16562","user_id":"15415","type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-15T10:34:15Z","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783540642756","9783540697152"],"issn":["0302-9743","1611-3349"]},"date_updated":"2022-01-06T06:52:52Z","publication_status":"published","title":"Communication-efficient parallel multiway and approximate minimum cut computation"}