A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph

Ken Takata. A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph. SIAM J. Discrete Math., 21(4):936-946, 2007. [doi]

@article{Takata07,
  title = {A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph},
  author = {Ken Takata},
  year = {2007},
  doi = {10.1137/060653032},
  url = {http://dx.doi.org/10.1137/060653032},
  tags = {analysis},
  researchr = {https://researchr.org/publication/Takata07},
  cites = {0},
  citedby = {0},
  journal = {SIAM J. Discrete Math.},
  volume = {21},
  number = {4},
  pages = {936-946},
}