Linear algorithms for graphs of tree-width at most four

Bibliographic Details
Main Author:	Sanders, Daniel Preston
Published:	Georgia Institute of Technology 2009
Subjects:	Graph theory Algorithms
Online Access:	http://hdl.handle.net/1853/30061

id	ndltd-GATECH-oai-smartech.gatech.edu-1853-30061
record_format	oai_dc
spelling	ndltd-GATECH-oai-smartech.gatech.edu-1853-300612013-12-15T03:43:55ZLinear algorithms for graphs of tree-width at most fourSanders, Daniel PrestonGraph theoryAlgorithmsGeorgia Institute of Technology2009-09-17T13:16:58Z2009-09-17T13:16:58Z1993-08Dissertation373649http://hdl.handle.net/1853/30061
collection	NDLTD
sources	NDLTD
topic	Graph theory Algorithms
spellingShingle	Graph theory Algorithms Sanders, Daniel Preston Linear algorithms for graphs of tree-width at most four
author	Sanders, Daniel Preston
author_facet	Sanders, Daniel Preston
author_sort	Sanders, Daniel Preston
title	Linear algorithms for graphs of tree-width at most four
title_short	Linear algorithms for graphs of tree-width at most four
title_full	Linear algorithms for graphs of tree-width at most four
title_fullStr	Linear algorithms for graphs of tree-width at most four
title_full_unstemmed	Linear algorithms for graphs of tree-width at most four
title_sort	linear algorithms for graphs of tree-width at most four
publisher	Georgia Institute of Technology
publishDate	2009
url	http://hdl.handle.net/1853/30061
work_keys_str_mv	AT sandersdanielpreston linearalgorithmsforgraphsoftreewidthatmostfour
_version_	1716619937934475264

Similar Items