Generating maximal independent sets for hypergraphs with bounded edge-intersections. Boros, E. & Elbassioni, K. In LATIN 2004: the 6th Latin American Symposium on Theoretical Informatics, volume 2976, of Lecture Notes in Computer Science, pages 488--498, Aires, Argentina, April, 2004. Springer Berlin Heidelberg.
Generating maximal independent sets for hypergraphs with bounded edge-intersections [link]Paper  doi  bibtex   
@inproceedings{ Boros2004,
  address = {Aires, Argentina},
  author = {Boros, Endre and Elbassioni, Khaled},
  booktitle = {LATIN 2004: the 6th Latin American Symposium on Theoretical Informatics},
  doi = {10.1007/978-3-540-24698-5_52},
  editor = {Farach-Colton, Martín},
  file = {:Users/KunihiroWASA/Dropbox/paper/2004/Boros, Elbassioni, Generating maximal independent sets for hypergraphs with bounded edge-intersections, 2004.pdf:pdf},
  month = {April},
  pages = {488--498},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {{Generating maximal independent sets for hypergraphs with bounded edge-intersections}},
  url = {http://link.springer.com/chapter/10.1007/978-3-540-24698-5_52},
  volume = {2976},
  year = {2004}
}

Downloads: 0