Lecture 3 - Spanning Trees Flashcards
1
Q
What is a spanning tree?
A
A subgraph (subset of edges) which is both a tree and spans every vertex of the original graph.
2
Q
How is a spanning tree obtained?
A
By deleting edges from the original graph.
3
Q
What is the weight of a spanning tree?
A
Sum of weight of its edges
4
Q
Where are spanning trees used? (minimum spanning tree)
A
- design of networks
- telecommunications
- transportation
- gas
- electricity
5
Q
What kind of a problem is getting the minimum spanning tree?
A
combinatorial optimisation problem
6
Q
Does spanning tree have cycles?
A
No otherwise it is not a spanning tree
7
Q
What complexity is the exhaustive search (brute force essentially) for getting minimum spanning trees.
A
exponential time
