The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
85 views
Is there any algorithm to find number of different minimum spanning trees for a graph?
in Mathematical Logic by Active (2.5k points) | 85 views
0

Kirchhoff's theorem can be used to count the number of spanning trees: https://en.wikipedia.org/wiki/Kirchhoff%27s_theorem

For MSTs: http://wwwmayr.in.tum.de/konferenzen/Jass08/courses/1/pieper/Pieper_Paper.pdf

0
u can post direct question
By permutation, combination we can also find it
0

Please log in or register to answer this question.

Related questions

0 votes
1 answer
5
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,339 questions
55,765 answers
192,356 comments
90,817 users