| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419856 | Discrete Applied Mathematics | 2011 | 11 Pages |
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
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
A.L.P. Guedes, L. Markenzon, L. Faria,