Computing the Minimum Cut and Maximum Flow of Undirected Graphs. Schroeder, J., Guedes, A. L. P., & Jr., E. P. D. Technical Report RT-DINF 003/2004, Departamento de Informática - UFPR, 2004. Pdf bibtex @TechReport{Elias2004,
author = {Jonatan Schroeder and Andr{é} Luiz Pires Guedes and
Elias Proc{ó}pio Duarte Jr.},
title = {Computing the Minimum Cut and Maximum Flow of
Undirected Graphs},
institution = {Departamento de Informática - UFPR},
year = 2004,
number = {RT-DINF 003/2004},
keywords = {RTEC,kwARG},
url_pdf =
{http://www.inf.ufpr.br/ppginf/Relatorios_Tecnicos/RT_DINF003_2004.pdf}
}
Downloads: 0
{"_id":"gL3Fo7W22j3RSvAWJ","bibbaseid":"schroeder-guedes-jr-computingtheminimumcutandmaximumflowofundirectedgraphs-2004","author_short":["Schroeder, J.","Guedes, A. L. P.","Jr., E. P. D."],"bibdata":{"bibtype":"techreport","type":"techreport","author":[{"firstnames":["Jonatan"],"propositions":[],"lastnames":["Schroeder"],"suffixes":[]},{"firstnames":["André","Luiz","Pires"],"propositions":[],"lastnames":["Guedes"],"suffixes":[]},{"firstnames":["Elias","Procópio","Duarte"],"propositions":[],"lastnames":["Jr."],"suffixes":[]}],"title":"Computing the Minimum Cut and Maximum Flow of Undirected Graphs","institution":"Departamento de Informática - UFPR","year":"2004","number":"RT-DINF 003/2004","keywords":"RTEC,kwARG","url_pdf":"http://www.inf.ufpr.br/ppginf/Relatorios_Tecnicos/RT_DINF003_2004.pdf","bibtex":"@TechReport{Elias2004,\n author = {Jonatan Schroeder and Andr{é} Luiz Pires Guedes and\n Elias Proc{ó}pio Duarte Jr.},\n title = {Computing the Minimum Cut and Maximum Flow of\n Undirected Graphs},\n institution = {Departamento de Informática - UFPR},\n year = 2004,\n number = {RT-DINF 003/2004},\n keywords = {RTEC,kwARG},\n url_pdf =\n {http://www.inf.ufpr.br/ppginf/Relatorios_Tecnicos/RT_DINF003_2004.pdf}\n}\n\n","author_short":["Schroeder, J.","Guedes, A. L. P.","Jr., E. P. D."],"key":"Elias2004","id":"Elias2004","bibbaseid":"schroeder-guedes-jr-computingtheminimumcutandmaximumflowofundirectedgraphs-2004","role":"author","urls":{" pdf":"http://www.inf.ufpr.br/ppginf/Relatorios_Tecnicos/RT_DINF003_2004.pdf"},"keyword":["RTEC","kwARG"],"metadata":{"authorlinks":{}}},"bibtype":"techreport","biburl":"http://www.inf.ufpr.br/andre/bibtex/meus.bib","dataSources":["8EF7A9sBtzR7yAc4T"],"keywords":["rtec","kwarg"],"search_terms":["computing","minimum","cut","maximum","flow","undirected","graphs","schroeder","guedes","jr."],"title":"Computing the Minimum Cut and Maximum Flow of Undirected Graphs","year":2004}