Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRobinson, R.-
dc.contributor.authorFarr, G.-
dc.identifier.citationAlgorithmica: an international journal in computer science, 2009; 55(4):703-728-
dc.descriptionThe original publication is available at
dc.description.abstractThe subgraph homeomorphism problem has been shown by Robertson and Seymour to be polynomial-time solvable for any fixed pattern graph H. The result, however, is not practical, involving constants that are worse than exponential in |H|. Practical algorithms have only been developed for a few specific pattern graphs, the most recent of these being the wheels with four and five spokes. This paper looks at the subgraph homeomorphism problem where the pattern graph is a wheel with six spokes. The main result is a theorem characterizing graphs that do not contain subdivisions of W 6. We give an efficient algorithm for solving the subgraph homeomorphism problem for W 6. We also give a strengthening of the previous W 5 result.-
dc.description.statementofresponsibilityRebecca Robinson and Graham Farr-
dc.rights© Springer Science+Business Media, LLC 2009-
dc.subjectGraph algorithms-
dc.subjectTopological containment-
dc.subjectSubgraph homeomorphism problem-
dc.titleStructure and Recognition of Graphs with No 6-wheel Subdivision-
dc.typeJournal article-
Appears in Collections:Aurora harvest
Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.