@Article{Guedes11,
   title        = {Flow hypergraph reducibility},
   journal      = {Discrete Applied Mathematics},
   volume       = {159},
   number       = {16},
   pages        = {1775-1785},
   year         = {2011},
   note           =  {8th   Cologne/Twente   Workshop   on  Graphs   and
                  Combinatorial Optimization (CTW 2009)},
   issn         = {0166-218X},
   doi          = {DOI: 10.1016/j.dam.2011.02.006},
   url                                                                 =
                  {http://www.sciencedirect.com/science/article/pii/S0166218X11000862},
   author       = {A. L. P. Guedes and L. Markenzon and L. Faria},
   keywords     = {Directed hypergraphs, Flowgraphs, Graph reducibility},
   abstract     = {Reducible  flowgraphs were first defined  by Allen in
                  terms of  intervals; another  definition based  on two
                  flowgraph transformations  was presented by  Hecht and
                  Ullman.   In  this  paper,  we extend  the  notion  of
                  reducibility to directed hypergraphs, proving that the
                  interval  and the  transformation approaches  preserve
                  the equivalence when applied to this family.},
   keywords     = {kwARG}
}

{"_id":"mN86ESKRQKMsAfRYD","bibbaseid":"guedes-markenzon-faria-flowhypergraphreducibility-2011","author_short":["Guedes, A. L. P.","Markenzon, L.","Faria, L."],"bibdata":{"bibtype":"article","type":"article","title":"Flow hypergraph reducibility","journal":"Discrete Applied Mathematics","volume":"159","number":"16","pages":"1775-1785","year":"2011","note":"8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009)","issn":"0166-218X","doi":"DOI: 10.1016/j.dam.2011.02.006","url":"http://www.sciencedirect.com/science/article/pii/S0166218X11000862","author":[{"firstnames":["A.","L.","P."],"propositions":[],"lastnames":["Guedes"],"suffixes":[]},{"firstnames":["L."],"propositions":[],"lastnames":["Markenzon"],"suffixes":[]},{"firstnames":["L."],"propositions":[],"lastnames":["Faria"],"suffixes":[]}],"keywords":"kwARG","abstract":"Reducible flowgraphs were first defined by Allen in terms of intervals; another definition based on two flowgraph transformations was presented by Hecht and Ullman. In this paper, we extend the notion of reducibility to directed hypergraphs, proving that the interval and the transformation approaches preserve the equivalence when applied to this family.","bibtex":"@Article{Guedes11,\n title = {Flow hypergraph reducibility},\n journal = {Discrete Applied Mathematics},\n volume = {159},\n number = {16},\n pages = {1775-1785},\n year = {2011},\n note = {8th Cologne/Twente Workshop on Graphs and\n Combinatorial Optimization (CTW 2009)},\n issn = {0166-218X},\n doi = {DOI: 10.1016/j.dam.2011.02.006},\n url =\n {http://www.sciencedirect.com/science/article/pii/S0166218X11000862},\n author = {A. L. P. Guedes and L. Markenzon and L. Faria},\n keywords = {Directed hypergraphs, Flowgraphs, Graph reducibility},\n abstract = {Reducible flowgraphs were first defined by Allen in\n terms of intervals; another definition based on two\n flowgraph transformations was presented by Hecht and\n Ullman. In this paper, we extend the notion of\n reducibility to directed hypergraphs, proving that the\n interval and the transformation approaches preserve\n the equivalence when applied to this family.},\n keywords = {kwARG}\n}\n\n","author_short":["Guedes, A. L. P.","Markenzon, L.","Faria, L."],"key":"Guedes11","id":"Guedes11","bibbaseid":"guedes-markenzon-faria-flowhypergraphreducibility-2011","role":"author","urls":{"Paper":"http://www.sciencedirect.com/science/article/pii/S0166218X11000862"},"keyword":["kwARG"],"metadata":{"authorlinks":{}},"downloads":2},"bibtype":"article","biburl":"http://www.inf.ufpr.br/andre/bibtex/meus.bib","dataSources":["8EF7A9sBtzR7yAc4T"],"keywords":["kwarg"],"search_terms":["flow","hypergraph","reducibility","guedes","markenzon","faria"],"title":"Flow hypergraph reducibility","year":2011,"downloads":2}