Flow Hypergraph Reducibility |
| |
| Institution: | 1. Universidade Federal do Paraná, PR, Brazil;2. Universidade Federal do Rio de Janeiro, RJ, Brazil;3. Universidade do Estado do Rio de Janeiro, RJ, Brazil;1. Center for Combinatorics and LPMC-TJKLC, Nankai University, Tianjin 300071, China;2. College of Science, China University of Mining and Technology, Xuzhou 221116, China;1. Department of Applied Mathematics, Northwestern Polytechnical University, Xi''an, Shaanxi 710072, PR China;2. Department of Econometrics and Tinbergen Institute, VU University Amsterdam, De Boelelaan 1105, 1081 HV Amsterdam, The Netherlands;1. Institute of Economics, Research Centre for Economic and Regional Studies, Hungarian Academy of Sciences, H-1112, Budaörsi út 45, Budapest, Hungary;2. Department of Operations Research and Actuarial Sciences, Corvinus University of Budapest, Hungary;3. Department of Computer Science and Information Theory, Budapest University of Technology and Economics, H-1117. Magyar tudósok körútja 2, Budapest, Hungary;1. Department of Applied Mathematics, Northwestern Polytechnical University, Xi''an, Shaanxi 710072, PR China;2. Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands;3. School of Science, Xi''an University of Science and Technology, Xi''an, Shaanxi 710054, PR China |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
