Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/1201
Full metadata record
DC FieldValueLanguage
dc.contributorMassachusetts Institute of Technology. Laboratory for Information and Decision Systems.-
dc.contributorParekh, Abhay Kumar.-
dc.date2002-06-21T03:39:44Z-
dc.date2002-06-21T03:39:44Z-
dc.date1991-
dc.date.accessioned2013-05-31T16:18:05Z-
dc.date.available2013-05-31T16:18:05Z-
dc.date.issued2013-06-01-
dc.identifierhttp://hdl.handle.net/1721.1/1201-
dc.identifier.urihttp://koha.mediu.edu.my:8181/jspui/handle/1721-
dc.descriptionAbhay K. Parekh.-
dc.descriptionIncludes bibliographical references (p. 4).-
dc.descriptionCover title.-
dc.descriptionResearch supported by a Vinton Hayes Fellowship.-
dc.format7 p.-
dc.formatapplication/pdf-
dc.languageeng-
dc.publisherMassachusetts Institute of Technology, Laboratory for Information and Decision Systems-
dc.relationLIDS-P ; 2018-
dc.subjectTK7855.M41 E3845 no.2018-
dc.titleAnalysis of a greedy heuristic for finding small dominating sets in graphs-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.