Show simple item record

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

dc.contributorMassachusetts Institute of Technology. Laboratory for Information and Decision Systems.
dc.contributorParekh, Abhay Kumar.
dc.date.accessioned2002-06-21T03:39:44Z
dc.date.available2002-06-21T03:39:44Z
dc.date.issued1991
dc.identifier.urihttp://hdl.handle.net/1721.1/1201
dc.descriptionIncludes bibliographical references (p. 4).en
dc.descriptionCover title.en
dc.description.sponsorshipResearch supported by a Vinton Hayes Fellowship.en
dc.description.statementofresponsibilityAbhay K. Parekh.
dc.format.extent7 p.
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherMassachusetts Institute of Technology, Laboratory for Information and Decision Systems
dc.relation.ispartofseriesLIDS-P ; 2018
dc.subject.lccTK7855.M41 E3845 no.2018
dc.titleAnalysis of a greedy heuristic for finding small dominating sets in graphsen


Files in this item

Thumbnail
Name:
P-2018-23138417.pdf
Size:
349.9Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record