Spanning tree algorithms
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 interpreti...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | text |
| اللغة: | English |
| منشور في: |
Animo Repository
1997
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://animorepository.dlsu.edu.ph/etd_bachelors/16339 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | 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. |
|---|