Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/1201| Title: | Analysis of a greedy heuristic for finding small dominating sets in graphs |
| Authors: | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. Parekh, Abhay Kumar. |
| Keywords: | TK7855.M41 E3845 no.2018 |
| Issue Date: | 1-Jun-2013 |
| Publisher: | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems |
| Description: | Abhay K. Parekh. Includes bibliographical references (p. 4). Cover title. Research supported by a Vinton Hayes Fellowship. |
| URI: | http://koha.mediu.edu.my:8181/jspui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/1201 |
| 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.