Flow hypergraph 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.

[1]  Sanjay Chawla,et al.  On local pruning of association rules using directed hypergraphs , 2004, Proceedings. 20th International Conference on Data Engineering.

[2]  Giorgio Ausiello,et al.  Strongly Equivalent Directed Hypergraphs , 1985 .

[3]  Gultekin Özsoyoglu,et al.  Pathways Database System: An Integrated System for Biological Pathways , 2003, Bioinform..

[4]  Jeffrey D. Ullman,et al.  Flow Graph Reducibility , 1972, SIAM J. Comput..

[5]  Giorgio Gallo,et al.  Directed Hypergraphs and Applications , 1993, Discret. Appl. Math..

[6]  Rahul Tripathi,et al.  Linear connectivity problems in directed hypergraphs , 2009, Theor. Comput. Sci..

[7]  Maria Grazia Scutellà,et al.  A note on minimum makespan assembly plans , 2002, Eur. J. Oper. Res..

[8]  Jeffrey D. Ullman,et al.  Characterizations of Reducible Flow Graphs , 1974, JACM.

[9]  Andrea Vietri.  The complexity of arc-colorings for directed hypergraphs , 2004, Discret. Appl. Math..

[10]  A. Church,et al.  Some properties of conversion , 1936 .

[11]  Lilian Markenzon,et al.  Solving problems for maximal reducible flowgraphs , 2004, Discret. Appl. Math..

[12]  Mysore Ramaswamy,et al.  Using Directed Hypergraphs to Verity Rule-Based Expert Systems , 1997, IEEE Trans. Knowl. Data Eng..

[13]  André Luiz Pires Guedes,et al.  Directed hypergraph planarity , 2005 .

[14]  Daniele Pretolani,et al.  A directed hypergraph model for random time dependent shortest paths , 2000, Eur. J. Oper. Res..

[15]  Frances E. Allen,et al.  Control-flow analysis , 2022 .

[16]  Adi Shamir,et al.  A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs , 1979, SIAM J. Comput..

[17]  Robert E. Tarjan.  Testing flow graph reducibility , 1973, STOC '73.

[18]  Daniele Pretolani,et al.  On Some Path Problems on Oriented Hypergraphs , 1998, RAIRO Theor. Informatics Appl..

[19]  Wei-Liang Lin,et al.  A linear arrangement problem with applications , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.