An Improved Implementation of Grimbleby's Algorithm

dc.contributor.author	Schach, Stephen R.
dc.date.accessioned	2018-05-23T15:21:00Z
dc.date.available	2018-05-23T15:21:00Z
dc.date.issued	1983
dc.identifier.citation	Schach, Stephen R. (1983) An Improved Implementation of Grimbleby's Algorithm. Quaestiones Informaticae Vol 2 No 3, 1983	en
dc.identifier.issn	0254-2757
dc.identifier.uri	http://hdl.handle.net/10500/24055
dc.description.abstract	Details are given of an implementation of Grimbleby's algorithm for the common spanning tree problem with running times up to 50% less than for the original implementation. An explanation is given as to why implementations with even lower running times are unlikely.	en
dc.language.iso	en	en
dc.publisher	Computer Society of South Africa (on behalf of SAICSIT)	en
dc.title	An Improved Implementation of Grimbleby's Algorithm	en
dc.type	Article	en
dc.description.department	School of Computing	en