The Feasibility and Use of a Minor Containment Algorithm

Xiong, Liu; Dinneen, Michael

dc.contributor.author	Xiong, Liu	en
dc.contributor.author	Dinneen, Michael	en
dc.date.accessioned	2009-04-08T04:03:27Z	en
dc.date.available	2009-04-08T04:03:27Z	en
dc.date.issued	2000-02	en
dc.identifier.citation	Computer Science Technical Reports 171 (2000)	en
dc.identifier.issn	1173-3500	en
dc.identifier.uri	http://hdl.handle.net/2292/3505	en
dc.description.abstract	We present a general algorithm for checking whether one graph is a minor of another. Although this algorithm is not polynomial-time, it is quite practical for small graphs. For all connected graphs with 5 vertices or less we count how many connected graphs of order at most 9 are above them in the minor order. Our computed tables may be useful in the design of heuristic algorithms for minor closed families of graphs.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	Computer Science Technical Reports	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/csTRcgi.pl?serial	en
dc.title	The Feasibility and Use of a Minor Containment Algorithm	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