ScholarLens Back to search
1983•Unisa Institutional Repository (University of South Africa)Open access

An Improved Implementation of Grimbleby's Algorithm

Stephen R. Schach

Open full text 0 citations

Abstract

Details are given of an implementation of Grimbleby's algorithm for the common spanning tree problem with running \ntimes up to 50% less than for the original implementation. An explanation is given as to why implementations with \neven lower running times are unlikely.

Open-access reader

About this research paper

What this paper is about

Details are given of an implementation of Grimbleby's algorithm for the common spanning tree problem with running \ntimes up to 50% less than for the original implementation. An explanation is given as to why implementations with \neven lower running times are unlikely.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Details are given of an implementation of Grimbleby's algorithm for the common spanning tree problem with running \ntimes up to 50% less than for the original implementation. An explanation is given as to why implementations with \neven lower running times are unlikely.

Key concepts: Computer science, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An Improved Implementation of Grimbleby's Algorithm — Research Paper | ScholarLens