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.
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
{"_id":"hJWnBxaYuQMzkjo2s","authorIDs":[],"author_short":["Boros, E.","Elbassioni, K."],"bibbaseid":"boros-elbassioni-generatingmaximalindependentsetsforhypergraphswithboundededgeintersections-2004","bibdata":{"address":"Aires, Argentina","author":["Boros, Endre","Elbassioni, Khaled"],"author_short":["Boros, E.","Elbassioni, K."],"bibtex":"@inproceedings{ Boros2004,\n address = {Aires, Argentina},\n author = {Boros, Endre and Elbassioni, Khaled},\n booktitle = {LATIN 2004: the 6th Latin American Symposium on Theoretical Informatics},\n doi = {10.1007/978-3-540-24698-5_52},\n editor = {Farach-Colton, Martín},\n file = {:Users/KunihiroWASA/Dropbox/paper/2004/Boros, Elbassioni, Generating maximal independent sets for hypergraphs with bounded edge-intersections, 2004.pdf:pdf},\n month = {April},\n pages = {488--498},\n publisher = {Springer Berlin Heidelberg},\n series = {Lecture Notes in Computer Science},\n title = {{Generating maximal independent sets for hypergraphs with bounded edge-intersections}},\n url = {http://link.springer.com/chapter/10.1007/978-3-540-24698-5_52},\n volume = {2976},\n year = {2004}\n}","bibtype":"inproceedings","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"],"editor_short":["Farach-Colton, M."],"file":":Users/KunihiroWASA/Dropbox/paper/2004/Boros, Elbassioni, Generating maximal independent sets for hypergraphs with bounded edge-intersections, 2004.pdf:pdf","id":"Boros2004","key":"Boros2004","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","type":"inproceedings","url":"http://link.springer.com/chapter/10.1007/978-3-540-24698-5_52","volume":"2976","year":"2004","bibbaseid":"boros-elbassioni-generatingmaximalindependentsetsforhypergraphswithboundededgeintersections-2004","role":"author","urls":{"Paper":"http://link.springer.com/chapter/10.1007/978-3-540-24698-5_52"},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:45.459Z","downloads":0,"keywords":[],"search_terms":["generating","maximal","independent","sets","hypergraphs","bounded","edge","intersections","boros","elbassioni"],"title":"Generating maximal independent sets for hypergraphs with bounded edge-intersections","year":2004,"dataSources":["YRMeqhMHoNu9HzJoC"]}