The Gateway to Computer Science Excellence
+2 votes
99 views
Is there any algorithm to find number of different minimum spanning trees for a graph?
in Mathematical Logic by Active | 99 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.

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
52,223 questions
59,811 answers
201,020 comments
118,087 users