On some path problems on oriented hypergraphs

S. Nguyen; D. Pretolani; L. Markenzon

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1998)

  • Volume: 32, Issue: 1-3, page 1-20
  • ISSN: 0988-3754

How to cite

top

Nguyen, S., Pretolani, D., and Markenzon, L.. "On some path problems on oriented hypergraphs." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 32.1-3 (1998): 1-20. <http://eudml.org/doc/92578>.

@article{Nguyen1998,
author = {Nguyen, S., Pretolani, D., Markenzon, L.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {eng},
number = {1-3},
pages = {1-20},
publisher = {EDP-Sciences},
title = {On some path problems on oriented hypergraphs},
url = {http://eudml.org/doc/92578},
volume = {32},
year = {1998},
}

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
PB - EDP-Sciences
VL - 32
IS - 1-3
SP - 1
EP - 20
LA - eng
UR - http://eudml.org/doc/92578
ER -

References

top
  1. 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. Zbl0861.90072
  2. 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. MR426484
  3. 3. G. GALLO, G. LONGO, S. NGUYEN and S. PALLOTTINO, Directed hypergraphs and applications. Discrete Applied Mathematics, 42(2-3) (1993), pp. 177-201. Zbl0771.05074MR1217096
  4. 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. Zbl0411.68039MR519066
  5. 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. 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. 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. Zbl0547.68044MR773424
  8. 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. Zbl0412.68052MR545530
  9. 9. S. C. NTAFOS and S. L. HAKIMI, On structured digraphs and program testing. IEEE Transactions on Computer, c-30 (1981), pp. 67-77. Zbl0454.68005MR600768
  10. 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. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.