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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/49835 |