Back to search

Georgia Institute of Technology

Linear algorithms for graphs of tree-width at most four

Abstract

Ph.D.

Degree

thesis:*
Department dc:contributor.department
Mathematics
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
1993

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Sanders, Daniel Preston
Advisor dc:contributor.advisor
  • Thomas, Robin

Subjects

dc:subject × 2

Identifiers

dc:identifier.*
Dc Identifier Other
373649

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Sanders, Daniel Preston. Linear algorithms for graphs of tree-width at most four. Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/30061