.

Kernelization algorithms for the vertex cover problem

LAUR Repository

Show simple item record

dc.contributor.author Abu-Khzam, Faisal N.
dc.contributor.author Collins, Rebecca L.
dc.contributor.author Fellows, Micheal R.
dc.contributor.author Langston, Micheal A.
dc.contributor.author Suters, W. Henry
dc.contributor.author Symons, Christopher T.
dc.date.accessioned 2017-03-21T11:26:17Z
dc.date.available 2017-03-21T11:26:17Z
dc.identifier.isbn 0-89871-564-4 en_US
dc.identifier.uri http://hdl.handle.net/10725/5409
dc.description.abstract A variety of efficient kernelization strategies for the classic vertex cover problem are developed, implemented and compared experimentally. A new technique, termed crown reduction, is introduced and analyzed. Applications to computational biology are discussed. en_US
dc.language.iso en en_US
dc.title Kernelization algorithms for the vertex cover problem en_US
dc.type Conference Paper / Proceeding en_US
dc.title.subtitle theory and experiments en_US
dc.author.school SAS en_US
dc.author.idnumber 200302941 en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.identifier.ctation Abu-Khzam, F. N., Collins, R. L., Fellows, M. R., Langston, M. A., Suters, W. H., & Symons, C. T. (2004). Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. ALENEX/ANALC, 69. en_US
dc.author.email faisal.abukhzam@lau.edu.lb en_US
dc.conference.date January 10, 2004 en_US
dc.conference.place New Orleans, LA, USA en_US
dc.conference.title ALENEX/ANALCO 2004 en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url http://www.siam.org/meetings/alenex04/abstacts/F-Abu-Khzam.pdf en_US
dc.orcid.id https://orcid.org/0000-0001-5221-8421
dc.author.affiliation Lebanese American University en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR


Advanced Search

Browse

My Account