| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652694 | Electronic Notes in Discrete Mathematics | 2008 | 6 Pages |
Abstract
Reducible flow graphs were first defined by Hecht and Ullman in terms of intervals; another definition, based on two flow graph transformations, was also presented. In this paper, we extend the notion of reducibility to directed hypergraphs, proving that the interval and the transformation approaches are still equivalent when applied to this family.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
