An efficient algorithm for the transversal hypergraph generation.

Kavvadias, Dimitris J.; Stavropoulos, Elias C.

Journal of Graph Algorithms and Applications (2005)

  • Volume: 9, Issue: 2, page 239-264
  • ISSN: 1526-1719

How to cite

top

Kavvadias, Dimitris J., and Stavropoulos, Elias C.. "An efficient algorithm for the transversal hypergraph generation.." Journal of Graph Algorithms and Applications 9.2 (2005): 239-264. <http://eudml.org/doc/52369>.

@article{Kavvadias2005,
author = {Kavvadias, Dimitris J., Stavropoulos, Elias C.},
journal = {Journal of Graph Algorithms and Applications},
language = {eng},
number = {2},
pages = {239-264},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {An efficient algorithm for the transversal hypergraph generation.},
url = {http://eudml.org/doc/52369},
volume = {9},
year = {2005},
}

TY - JOUR
AU - Kavvadias, Dimitris J.
AU - Stavropoulos, Elias C.
TI - An efficient algorithm for the transversal hypergraph generation.
JO - Journal of Graph Algorithms and Applications
PY - 2005
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 9
IS - 2
SP - 239
EP - 264
LA - eng
UR - http://eudml.org/doc/52369
ER -

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.