Practical Enumeration Methods for Graphs of Bounded Pathwidth and Treewidth

Dinneen, Michael

dc.contributor.author	Dinneen, Michael	en
dc.date.accessioned	2009-04-16T23:15:58Z	en
dc.date.available	2009-04-16T23:15:58Z	en
dc.date.issued	1997-09	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-055 (1997)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3564	en
dc.description.abstract	Using an algebraic representation for graphs of bounded pathwidth or treewidth we provide simple methods for generating these families in increasing order of the number of vertices and edges. We also study canonic representions of fixed- and free- boundaried graphs of bounded width.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	Practical Enumeration Methods for Graphs of Bounded Pathwidth and Treewidth	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en