Title:
Linear algorithms for graphs of tree-width at most four

dc.contributor.advisor Thomas, Robin
dc.contributor.author Sanders, Daniel Preston en_US
dc.contributor.department Mathematics en_US
dc.contributor.department Algorithms, Combinatorics, and Optimization en_US
dc.date.accessioned 2009-09-17T13:16:58Z
dc.date.available 2009-09-17T13:16:58Z
dc.date.issued 1993-08 en_US
dc.description.degree Ph.D. en_US
dc.identifier.other 373649 en_US
dc.identifier.uri http://hdl.handle.net/1853/30061
dc.publisher Georgia Institute of Technology en_US
dc.subject.lcsh Graph theory en_US
dc.subject.lcsh Algorithms en_US
dc.title Linear algorithms for graphs of tree-width at most four en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.corporatename College of Sciences
local.contributor.corporatename School of Mathematics
local.relation.ispartofseries Doctor of Philosophy with a Major in Algorithms, Combinatorics, and Optimization
relation.isOrgUnitOfPublication 85042be6-2d68-4e07-b384-e1f908fae48a
relation.isOrgUnitOfPublication 84e5d930-8c17-4e24-96cc-63f5ab63da69
relation.isSeriesOfPublication 186126ed-fc79-4186-8523-2cb526aa622e
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
sanders_daniel_p_199308_phd_373649.pdf
Size:
3.94 MB
Format:
Adobe Portable Document Format
Description: