HistoryStudent1
Badges: 7
Rep:
?
#1
Report Thread starter 5 years ago
#1
How do you find the Maximum minimum spanning tree of a graph? I had a question of a graph with 5 vertices and 8 edges. It isn't, as I thought, the 4 highest edges, and my decision teacher figure it out...
0
reply
TSR Jessica
Badges: 19
Rep:
?
#2
Report 5 years ago
#2
Sorry you've not had any responses about this. Are you sure you’ve posted in the right place? Posting in the specific Study Help forum should help get responses.

I'm going to quote in She-Ra now so she can move your thread to the right place if it's needed. :yy:

Spoiler:
Show
(Original post by She-Ra)
x
0
reply
Bobjim12
Badges: 20
Rep:
?
#3
Report 5 years ago
#3
(Original post by HistoryStudent1)
How do you find the Maximum minimum spanning tree of a graph? I had a question of a graph with 5 vertices and 8 edges. It isn't, as I thought, the 4 highest edges, and my decision teacher figure it out...
Do you mean a minimum spanning tree using Prim's/kruskall's? haven't heard of a maximum minum spanning tree
0
reply
User1686961
Badges: 12
Rep:
?
#4
Report 5 years ago
#4
(Original post by HistoryStudent1)
How do you find the Maximum minimum spanning tree of a graph? I had a question of a graph with 5 vertices and 8 edges. It isn't, as I thought, the 4 highest edges, and my decision teacher figure it out...
Wtf is a maximum minimum spanning tree?
There is a thing called a maximum matching algorithm to find an improved and complete matching.
You use prim and kruskals to find a minimum spanning tree.
0
reply
She-Ra
Badges: 21
Rep:
?
#5
Report 5 years ago
#5
(Original post by HistoryStudent1)
How do you find the Maximum minimum spanning tree of a graph? I had a question of a graph with 5 vertices and 8 edges. It isn't, as I thought, the 4 highest edges, and my decision teacher figure it out...
I've moved it to the correct forum

Good Luck!
0
reply
HistoryStudent1
Badges: 7
Rep:
?
#6
Report Thread starter 5 years ago
#6
(Original post by Bobjim12)
Do you mean a minimum spanning tree using Prim's/kruskall's? haven't heard of a maximum minum spanning tree
(Original post by ThatGuyRik)
Wtf is a maximum minimum spanning tree?
There is a thing called a maximum matching algorithm to find an improved and complete matching.
You use prim and kruskals to find a minimum spanning tree.
I understand Prim's and Kruskal's, but you had to find a maximum minimum spanning tree - it's from the JAN 09 paper.
0
reply
kaduffy
Badges: 1
Rep:
?
#7
Report 5 years ago
#7
It might be worth keeping in mind that the syllabus has changed in recent years so it might not be relevant? Bc I don't think I've ever heard of a maximum minimum spanning tree.
0
reply
User1686961
Badges: 12
Rep:
?
#8
Report 5 years ago
#8
(Original post by HistoryStudent1)
I understand Prim's and Kruskal's, but you had to find a maximum minimum spanning tree - it's from the JAN 09 paper.
No you didn't i just checked.
0
reply
Kevin De Bruyne
Badges: 21
Rep:
?
#9
Report 5 years ago
#9
(Original post by HistoryStudent1)
I understand Prim's and Kruskal's, but you had to find a maximum minimum spanning tree - it's from the JAN 09 paper.
I've skimmed through the paper and there isn't a mention of a maximum minimum spanning tree - which question is it?
0
reply
HistoryStudent1
Badges: 7
Rep:
?
#10
Report Thread starter 5 years ago
#10
http://filestore.aqa.org.uk/subjects...W-QP-JAN09.PDF it is AQA and is question 6 (b), a graph theory question.
0
reply
X

Quick Reply

Attached files
Write a reply...
Reply
new posts
Back
to top
Latest
My Feed

See more of what you like on
The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

Personalise

How are you feeling being back in school?

Happy (11)
16.67%
Unhappy (20)
30.3%
Conflicted (35)
53.03%

Watched Threads

View All