DSpace Repository

Analysis of a greedy heuristic for finding small dominating sets in graphs

Show simple item record

dc.contributor Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
dc.contributor Parekh, Abhay Kumar.
dc.date 2002-06-21T03:39:44Z
dc.date 2002-06-21T03:39:44Z
dc.date 1991
dc.date.accessioned 2013-05-31T16:18:05Z
dc.date.available 2013-05-31T16:18:05Z
dc.date.issued 2013-06-01
dc.identifier http://hdl.handle.net/1721.1/1201
dc.identifier.uri http://koha.mediu.edu.my:8181/jspui/handle/1721
dc.description Abhay K. Parekh.
dc.description Includes bibliographical references (p. 4).
dc.description Cover title.
dc.description Research supported by a Vinton Hayes Fellowship.
dc.format 7 p.
dc.format application/pdf
dc.language eng
dc.publisher Massachusetts Institute of Technology, Laboratory for Information and Decision Systems
dc.relation LIDS-P ; 2018
dc.subject TK7855.M41 E3845 no.2018
dc.title Analysis of a greedy heuristic for finding small dominating sets in graphs


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account