Title

Spanning tree algorithms

Date of Publication

1997

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics Department

Abstract/Summary

This thesis presents a comprehensive study of spanning trees algorithm. Spanning tree is defined as a subgraph of a graph G that is said to be a tree containing all vertices of G. This could be derived by passing through all possible path in a tree. There are different ways of finding and interpreting spanning trees, this could be derived by using algorithms.

All of the algorithms stated in this thesis are based from the article of Harold Reiter and Isaac Sonin in their article entitled The Join the Club Interpretation of Some Graph Algorithms. The researchers provided a more explicit interpretation of the Join the Club context, since the reference only presented the concept of the said context.

Abstract Format

html

Language

English

Format

Print

Accession Number

TU07653

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

Physical Description

68 leaves

Keywords

Algorithms; Trees (Graph theory); Computer software

This document is currently not available here.

Share

COinS