Title of article
Flow Hypergraph Reducibility
Author/Authors
Guedes، نويسنده , , A.L.P. and Markenzon، نويسنده , , L. and Faria، نويسنده , , L.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
6
From page
255
To page
260
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.
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2008
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454870
Link To Document