Show simple item record

dc.contributor.authorTang, Ganggui
dc.date.accessioned2015-01-06T15:39:14Z
dc.date.available2015-01-06T15:39:14Z
dc.date.issued2015-01-06
dc.identifier.urihttp://hdl.handle.net/10222/56045
dc.description.abstractIn this thesis we consider the problem of edge orientation, where the goal is to orient the edges of an undirected dynamic graph with n vertices so that the out-degree of every vertex is bounded, typically by a function of the graph's arboricity.en_US
dc.language.isoenen_US
dc.subjectGraph Orientationen_US
dc.titleFully Dynamic Graph Orientationen_US
dc.typeThesisen_US
dc.date.defence2014-12-19
dc.contributor.departmentFaculty of Computer Scienceen_US
dc.contributor.degreeMaster of Computer Scienceen_US
dc.contributor.external-examinern/aen_US
dc.contributor.graduate-coordinatorDr. Evangelos E. Miliosen_US
dc.contributor.thesis-readerDr. Michael McAllisteren_US
dc.contributor.thesis-readerDr. Alex Brodskyen_US
dc.contributor.thesis-supervisorDr. Norbert Zehen_US
dc.contributor.thesis-supervisorDr. Meng He
dc.contributor.ethics-approvalNot Applicableen_US
dc.contributor.manuscriptsNoen_US
dc.contributor.copyright-releaseNoen_US
 Find Full text

Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record