@article{ journals/disopt/BarthBDF06,
  added-at = {2009-03-29T00:00:00.000+0100},
  author = {Barth, Dominique and Berthomé, Pascal and Diallo, Madiagne and Ferreira, Afonso},
  biburl = {http://www.bibsonomy.org/bibtex/273cb84abcb8f499fe35419cab7ed7cc0/dblp},
  date = {2009-03-29},
  description = {dblp},
  ee = {http://dx.doi.org/10.1016/j.disopt.2006.05.003},
  interhash = {feb43fcd389941be8881f0ffbef84025},
  intrahash = {73cb84abcb8f499fe35419cab7ed7cc0},
  journal = {Discrete Optimization},
  keywords = {dblp},
  number = {3},
  pages = {195-205},
  title = {Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations.},
  url = {http://dblp.uni-trier.de/db/journals/disopt/disopt3.html#BarthBDF06},
  volume = {3},
  year = {2006}
}

{"_id":"HkSriRe98BsFbyaE4","authorIDs":[],"author_short":["Barth, D.","Berthomé, P.","Diallo, M.","Ferreira, A."],"bibbaseid":"barth-berthom-diallo-ferreira-revisitingparametricmultiterminalproblemsmaximumflowsminimumcutsandcuttreecomputations-2006","bibdata":{"added-at":"2009-03-29T00:00:00.000+0100","author":["Barth, Dominique","Berthomé, Pascal","Diallo, Madiagne","Ferreira, Afonso"],"author_short":["Barth, D.","Berthomé, P.","Diallo, M.","Ferreira, A."],"bibtex":"@article{ journals/disopt/BarthBDF06,\n added-at = {2009-03-29T00:00:00.000+0100},\n author = {Barth, Dominique and Berthomé, Pascal and Diallo, Madiagne and Ferreira, Afonso},\n biburl = {http://www.bibsonomy.org/bibtex/273cb84abcb8f499fe35419cab7ed7cc0/dblp},\n date = {2009-03-29},\n description = {dblp},\n ee = {http://dx.doi.org/10.1016/j.disopt.2006.05.003},\n interhash = {feb43fcd389941be8881f0ffbef84025},\n intrahash = {73cb84abcb8f499fe35419cab7ed7cc0},\n journal = {Discrete Optimization},\n keywords = {dblp},\n number = {3},\n pages = {195-205},\n title = {Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations.},\n url = {http://dblp.uni-trier.de/db/journals/disopt/disopt3.html#BarthBDF06},\n volume = {3},\n year = {2006}\n}","bibtype":"article","biburl":"http://www.bibsonomy.org/bibtex/273cb84abcb8f499fe35419cab7ed7cc0/dblp","date":"2009-03-29","description":"dblp","ee":"http://dx.doi.org/10.1016/j.disopt.2006.05.003","id":"journals/disopt/BarthBDF06","interhash":"feb43fcd389941be8881f0ffbef84025","intrahash":"73cb84abcb8f499fe35419cab7ed7cc0","journal":"Discrete Optimization","key":"journals/disopt/BarthBDF06","keywords":"dblp","number":"3","pages":"195-205","title":"Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations.","type":"article","url":"http://dblp.uni-trier.de/db/journals/disopt/disopt3.html#BarthBDF06","volume":"3","year":"2006","bibbaseid":"barth-berthom-diallo-ferreira-revisitingparametricmultiterminalproblemsmaximumflowsminimumcutsandcuttreecomputations-2006","role":"author","urls":{"Link":"http://dx.doi.org/10.1016/j.disopt.2006.05.003","Paper":"http://dblp.uni-trier.de/db/journals/disopt/disopt3.html#BarthBDF06"},"keyword":["dblp"],"downloads":0},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Afonso?items=1000","creationDate":"2014-12-16T16:10:04.899Z","downloads":0,"keywords":["dblp"],"search_terms":["revisiting","parametric","multi","terminal","problems","maximum","flows","minimum","cuts","cut","tree","computations","barth","berthomé","diallo","ferreira"],"title":"Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations.","year":2006,"dataSources":["TeDEwZgcLYbgZSAYJ"]}