Checking for Substructures in Graphs of Bounded Pathwidth and Treewidth

Walsh, J; Dinneen, Michael

dc.contributor.author	Walsh, J	en
dc.contributor.author	Dinneen, Michael	en
dc.date.accessioned	2009-04-16T23:18:32Z	en
dc.date.available	2009-04-16T23:18:32Z	en
dc.date.issued	2002-12	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-205 (2002)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3713	en
dc.description.abstract	Using a previously developed algebraic representation system for graphs of bounded pathwidth and treewidth, efficient membership algorithms are built for subgraph, minor and topological- minor partial orders. Semi-automatic procedures for these problems are presented through numerous explanatory figures and source code. An enumeration scheme for building membership automata for fixed graph substructures of graphs of bounded width will also be introduced.	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	Checking for Substructures in 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