Show simple item record

Complexity and approximation algorithms for the Maximum Leaf Spanning Tree Problem and its variations

dc.contributor.authorZhou, Yijieen_US
dc.date.accessioned2013-05-24T18:25:21Z
dc.date.available2013-05-24T18:25:21Z
dc.date.issued2007en_US
dc.identifier(Sirsi) a1707648en_US
dc.identifier.urihttp://hdl.handle.net/1993/20980
dc.description.abstracten_US
dc.format.extent6923671 bytesen_US
dc.language.isoengen_US
dc.rightsen_US
dc.rightsinfo:eu-repo/semantics/openAccess
dc.titleComplexity and approximation algorithms for the Maximum Leaf Spanning Tree Problem and its variationsen_US
dc.typeinfo:eu-repo/semantics/masterThesis
dc.typemaster thesisen_US
dc.degree.disciplineComputer Scienceen_US
dc.degree.levelMaster of Science (M.Sc.)en_US


Files in this item

Thumbnail
Name:
Zhou_Complexity_and.pdf
Size:
6.602Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record