Show simple item record

dc.contributor.authorSanders, Daniel Prestonen_US
dc.date.accessioned2009-09-17T13:16:58Z
dc.date.available2009-09-17T13:16:58Z
dc.date.issued1993-08en_US
dc.identifier.other373649en_US
dc.identifier.urihttp://hdl.handle.net/1853/30061
dc.publisherGeorgia Institute of Technologyen_US
dc.subject.lcshGraph theoryen_US
dc.subject.lcshAlgorithmsen_US
dc.titleLinear algorithms for graphs of tree-width at most fouren_US
dc.typeDissertationen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMathematicsen_US
dc.contributor.departmentAlgorithms, Combinatorics, and Optimizationen_US
dc.description.advisorRobin Thomasen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record