On some path problems on oriented hypergraphs
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 32 (1998) no. 1-3, pp. 1-20. 
@article{ITA_1998__32_1-3_1_0,
     author = {Nguyen, S. and Pretolani, D. and Markenzon, L.},
     title = {On some path problems on oriented hypergraphs},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {1--20},
     publisher = {EDP-Sciences},
     volume = {32},
     number = {1-3},
     year = {1998},
     mrnumber = {1657503},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1998__32_1-3_1_0/}
}
TY  - JOUR
AU  - Nguyen, S.
AU  - Pretolani, D.
AU  - Markenzon, L.
TI  - On some path problems on oriented hypergraphs
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1998
SP  - 1
EP  - 20
VL  - 32
IS  - 1-3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1998__32_1-3_1_0/
LA  - en
ID  - ITA_1998__32_1-3_1_0
ER  - 
%0 Journal Article
%A Nguyen, S.
%A Pretolani, D.
%A Markenzon, L.
%T On some path problems on oriented hypergraphs
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1998
%P 1-20
%V 32
%N 1-3
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1998__32_1-3_1_0/
%G en
%F ITA_1998__32_1-3_1_0
Nguyen, S.; Pretolani, D.; Markenzon, L. On some path problems on oriented hypergraphs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 32 (1998) no. 1-3, pp. 1-20. http://www.numdam.org/item/ITA_1998__32_1-3_1_0/

1. H. El-Rewini and T. G. Lewis, Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel and Distributed Computing, 9 (1990, pp. 138-153.

2. H. N. Gabow, S. N. Maleshwari and L. J. Osterweil, On two problems in the generation of program test paths, EEE Transactions on Software Engineering, SE-2 (1976), pp. 227-231. | MR

3. G. Gallo, G. Longo, S. Nguyen and S. Pallottino, Directed hypergraphs and applications. Discrete Applied Mathematics, 42(2-3) (1993), pp. 177-201. | MR | Zbl

4. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H, Freeman, San Francisco, Ca., 1979. | MR | Zbl

5. A. Kapelnikov, R. R. Muntz and M. D. Ercegovac, A modeling methodology for the analysis of cuncurrent Systems and computations. Journal of Parallel and Distributed Computing, 6 (1989), pp. 568-597.

6. L. Markenzon and J. L. Szwarcfiter, Dois problemas de caminhos com restrições.In: XX Simpósio Brasileiro de Pesquisa Operacional, page 148, 1987.

7. S. C. Ntafos and T. Gonzalez, On the computational complexity of path cover problems. Journal of Computer and System Science, 29 (1984), pp. 225-242. | MR | Zbl

8. S. C. Ntafos and S. L. Hakimi, On path cover problems in digraphs and applications to program testing. IEEE Transactions on Software Engineering, SE-5 (1979), pp. 520-529. | MR | Zbl

9. S. C. Ntafos and S. L. Hakimi, On structured digraphs and program testing. IEEE Transactions on Computer, c-30 (1981), pp. 67-77. | MR | Zbl

10. R. A. Sahner and K. S. Trivedi, Performance and reliability analysis using directed acyclic graphs. IEEE Transactions on Software Engineering, SE-13 (1987), pp. 1105-1114.