Flow hypergraph reducibility

Discrete Applied Mathematics

Volumn 159, Issue 16, 2011, Pages 1775-1785

  Guedes, A L P ^a   Markenzon, L ^b   Faria, L ^c  

^a FEDERAL UNIVERSITY OF PARANÁ   (Brazil)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c STATE UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Directed hypergraphs; Flowgraphs; Graph reducibility

Indexed keywords

DIRECTED HYPERGRAPHS; FLOW GRAPH; FLOW-GRAPHS; GRAPH REDUCIBILITY; HYPERGRAPH;

GRAPH THEORY;

GRAPHIC METHODS;

EID: 80051796831     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2011.02.006     Document Type: Conference Paper

References (21)

1. F.E. Allen Control flow analysis SIGPLAN Notices 5 7 1970 1 19
2. G. Ausiello, A. D'Atri, and D. Sacc Strongly equivalent directed hypergraphs Analysis and Design of Algorithms for Combinatorial Problems Annals of Discrete Mathematics vol. 25 1985 North-Holland Amsterdam 1 25
3. S. Chawla, J. Davis, and G. Pandey On local pruning of association rules using directed hypergraphs ICDE'04: Proceedings of the 20th International Conference on Data Engineering 2004 IEEE Computer Society Washington, DC, USA 832
4. A. Church, and J.B. Rosser Some properties of conversion Transactions of the American Mathematical Society 39 3 1936 472 482
5. G. Gallo, G. Longo, S. Nguyen, S. Pallottino, Gli ipergrafi orientati: un nuovo approccio per la formulazione e risoluzione di problemi combinatori, in: Atti delle Giornate di Lavoro AIRO 89, AIRO (Associazione Italiana di Ricerca Operativa), Udine, Italy, 1989, 217236.
6. G. Gallo, G. Longo, S. Nguyen, and S. Pallottino Directed hypergraphs and applications Discrete Applied Mathematics 42 1993 177 201
7. G. Gallo, and M.G. Scutell A note on minimum makespan assembly plans European Journal of Operational Research 142 2 2002 309 320 (Pubitemid 34805994)
8. A.L.P. Guedes, Hipergrafos direcionados, D.Sc. Thesis, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brasil, Aug. 2001.
9. A.L.P. Guedes, and L. Markenzon Directed hypergraph planarity Pesquisa Operacional 25 3 2005 383 390
10. M.S. Hecht, and J.D. Ullman Flow graph reducibility SIAM Journal of Computing 2 2 1972 188 202
11. M.S. Hecht, and J.D. Ullman Characterizations of reducible flow graphs Journal of the Association for Computing Machinery 21 3 1974 367 375
12. L. Krishnamurthy, J. Nadeau, G. Ozsoyoglu, M. Ozsoyoglu, G. Schaeffer, M. Tasan, and W. Xu Pathways database system: an integrated system for biological pathways Bioinformatics 19 8 2003 930 937 (Pubitemid 36675812)
13. W.-L. Lin, and M. Sarrafzadeh A linear arrangement problem with applications ISCAS'95 International Symposium on Circuits and Systems, vol. 1 1995 IEEE pp. 6760
14. S. Nguyen, D. Pretolani, and L. Markenzon On some path problems on oriented hypergraphs RAIRO - Informatique Theorique et Applications (Theoretical Informatics and Applications) 32 1 1998 1 20
15. D. Pretolani A directed hypergraph model for random time dependent shortest paths European Journal of Operational Research 123 2 2000 315 324 (Pubitemid 30596942)
16. M. Ramaswamy, S. Sarkar, and Y.-S. Chen Using directed hypergraphs to verify rule-based expert systems IEEE Transactions on Knowledge and Data Engeneering 9 2 1997 221 237 (Pubitemid 127763267)
17. A. Shamir A linear time algorithm for finding minimum cutsets in reducible graphs SIAM Journal on Computing 8 4 1979 645 655
18. R. Tarjan Testing flow graph reducibility STOC'73: Proceedings of the fifth annual ACM Symposium on Theory of Computing 1973 ACM Press New York, NY, USA 96 107
19. M. Thakur, and R. Tripathi Linear connectivity problems in directed hypergraphs Theoretical Computer Science 410 27-29 2009 2592 2618
20. O. Vernet, and L. Markenzon Solving problems for maximal reducible flowgraphs Discrete Applied Mathematics 136 23 2004 341 348
21. A. Vietri The complexity of arc-colorings for directed hypergraphs Discrete Applied Mathematics 143 1-3 2004 266 271