On the Minimum Spanning Tree for Directed Graphs with Potential Weights

Details On the Minimum Spanning Tree for Directed Graphs with Potential Weights On the Minimum Spanning Tree for Directed Graphs with Potential Weights

2008-01-15

arxiv.org/abs/0801.2347v1

Computer Science

Discrete Mathematics

3 pages

Scientific paper

In general the problem of finding a miminum spanning tree for a weighted directed graph is difficult but solvable. There are a lot of differences between problems for directed and undirected graphs, therefore the algorithms for undirected graphs cannot usually be applied to the directed case. In this paper we examine the kind of weights such that the problems are equivalent and a minimum spanning tree of a directed graph may be found by a simple algorithm for an undirected graph.

Affiliated with

Also associated with

No associations

Rating

On the Minimum Spanning Tree for Directed Graphs with Potential Weights does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Minimum Spanning Tree for Directed Graphs with Potential Weights, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Minimum Spanning Tree for Directed Graphs with Potential Weights will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-151428