id: 05964715
dt: j
an: 05964715
au: Guedes, A.L.P.; Markenzon, L.; Faria, L.
ti: Flow hypergraph reducibility.
so: Discrete Appl. Math. 159, No. 16, 1775-1785 (2011).
py: 2011
pu: Elsevier Science B.V. (North-Holland), Amsterdam
la: EN
cc: 
ut: directed hypergraphs; flowgraphs; graph reducibility
ci: 
li: doi:10.1016/j.dam.2011.02.006
ab: Summary: 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.
rv: