Implementation issues for Feo and Provan's delta-wye-delta reduction algorithm

dc.contributor.author	Song, Xiaohuan	en_US
dc.date.accessioned	2024-08-15T18:24:40Z
dc.date.available	2024-08-15T18:24:40Z
dc.date.copyright	2001	en_US
dc.date.issued	2001
dc.degree.department	Department of Computer Science	en_US
dc.degree.level	Master of Science M.Sc.	en
dc.description.abstract	A graph is planar if it can be drawn on the plane with no crossing edges. A graph that can be efficiently reduced to a single edge by repeatedly using one of the six transformations (loop, pendant, series, parallel, delta-wye and wye-delta) in any order is called a D.Y 6-reducible graph and the corresponding algorithm is called 61'' 6-algorithm. A simple O(n2) 6Y 6 algorithm for reducing a planar graph to a single edge was provided by Feo and Provan m 1993. We diagnosed a problem with the algorithm, then fixed it and proved the correctness of the modified algorithm. We also proved this algorithm is f2(n2) through reducing on a family of graph we have constructed. The final code was tested using a large number of small graphs and the output was used to investigate various conjectures.
dc.format.extent	112 pages
dc.identifier.uri	https://hdl.handle.net/1828/19759
dc.rights	Available to the World Wide Web	en_US
dc.title	Implementation issues for Feo and Provan's delta-wye-delta reduction algorithm	en_US
dc.type	Thesis	en_US

Files

Now showing 1 - 1 of 1