Solution strategies for the spanning tree detection problem
For a given undirected, simple and connected graph G = (V, E) with edges associated with integer weights, the spanning tree detection problem (STDP) is to find, if one exists, the target weight value α of the spanning tree. There are numerous ways to solve this problem. Approximate algorithm is a gr...
Saved in:
Main Author: | Ye, Min Thu. |
---|---|
Other Authors: | Low Chor Ping |
Format: | Final Year Project |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/49835 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Recovery algorithm for multicast tree
by: Sadagopan Sridharan
Published: (2008) -
Recovery algorithm for time-constrained multicast tree
by: Jin, Yan Hong
Published: (2008) -
Design of interactive learning courseware for binary trees
by: He, Shiyu
Published: (2020) -
Self-healing algorithm for real-time multicast tree
by: Au, Ivan.
Published: (2008) -
Machine learning for 3D reconstruction of tree roots
by: Lim, Nikki Zhi Li
Published: (2023)