Stuck on solving the Minimal Spanning Tree problem.

Posted by kunjaan on Stack Overflow See other posts from Stack Overflow or by kunjaan
Published on 2009-05-20T20:06:11Z Indexed on 2010/05/16 6:50 UTC
Read the original article Hit count: 191

Filed under:

graphs

|

minimum-spanning-tree

|

algorithm

I have reduced my problem to finding the minimal spanning tree in the graph. But I want to have one more constraint which is that the total degree for each vertex shouldnt exceed a certain constant factor. How do I model my problem? Is MST the wrong path? Do you know any algorithms that will help me?

One more problem: My graph has duplicate edge weights so is there a way to count the number of unique MSTs? Are there algorithms that do this?

Thank You.

Edit: By degree, I mean the total number of edges connecting the vertex. By duplicate edge weight I mean that two edges have the same weight.

© Stack Overflow or respective owner

Related posts about graphs

C# Generate MRTG/RRD like Graphs Performance graphs?

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a database with Performance counter data and i would like to show this on a ASP.net page but the thing is i don't want to use Flash based charting solution or a Javascript based solution i would like to just generate images and use those I want the images to be like those of RRD or MRTG. I'm… >>> More
Create Custom Web-based Graphs with the Google Chart API and PHP

as seen on Internet.com - Search for 'Internet.com'
Presenting data visually can quickly reveal crucial trends. Learn how to use the Google Chart API in conjunction with PHP to create a variety of useful charts. >>> More
Working with Graphs and Gauges in JDeveloper 11

as seen on Oracle Technology Network - Search for 'Oracle Technology Network'
New how-to's on the data visualization components >>> More
What scientific plotting software is available?

as seen on Ask Ubuntu - Search for 'Ask Ubuntu'
I am currently doing some experimental work and I have a lot of data to trawl though. I use Gnumeric, and it's very good, but often I feel there has to be something better. Ideally I would like the maximum number of features with a minimal learning curve, but really I'd just like to know if there… >>> More
How to apply numerical integration on a graph layout

as seen on Game Development - Search for 'Game Development'
I've done some basic 1 D integration, but i can't wrap my head around things and apply it to my graph layout. So, consider the picture below: if i drag the red node to the right, i'm forcing his position to my mouse position the other nodes will "follow" him, but how ? For Verlet, to compute the… >>> More

Related posts about minimum-spanning-tree

Updating a Minimum spanning tree when a new edge is inserted

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello, I've been presented the following problem in University: Let G = (V, E) be an (undirected) graph with costs ce = 0 on the edges e € E. Assume you are given a minimum-cost spanning tree T in G. Now assume that a new edge is added to G, connecting two nodes v, tv € V with cost c. a) Give an… >>> More
A minimum spanning tree / shortest path in a directed graph

as seen on Stack Overflow - Search for 'Stack Overflow'
Given a directed graph with weighted edges, what algorithm can be used to give a sub-graph that has minimum weight, but allows movement from any vertex to any other vertex in the graph (under the assumption that paths between any two vertices always exist). Does such an algorithm exist? >>> More
A two way minimum spanning tree of a directed graph

as seen on Stack Overflow - Search for 'Stack Overflow'
Given a directed graph with weighted edges, what algorithm can be used to give a sub-graph that has minimum weight, but allows movement from any vertex to any other vertex in the graph (under the assumption that paths between any two vertices always exist). Does such an algorithm exist? >>> More
Minimum spanning tree [closed]

as seen on Stack Overflow - Search for 'Stack Overflow'
Iam having difficulty in implementing a minimum spanning tree. So please can someone please post a link to it's source code. >>> More
Is there a minimum spanning tree that does not contain the min/max weighted edge?

as seen on Stack Overflow - Search for 'Stack Overflow'
If we have an (arbitrary) connected undirected graph G, whose edges have distinct weights, does every MST of G contains the minimum weighted edge? is there an MST of G that does not contain the maximum weighted edge? Also, I'm more thankful if someone can give a hint of the key things one must… >>> More