The polynomial algorithm for optimal spanning hyperforest problem

Details The polynomial algorithm for optimal spanning hyperforest problem The polynomial algorithm for optimal spanning hyperforest problem

2007-02-26

arxiv.org/abs/math/0702757v2

Mathematics

Combinatorics

7 pages, 2 figures

Scientific paper

This paper is devoted to one theory of hypergraph connectivity and presents
the proof of the polynomial algorithm for finding an optimal spanning
hyperforest(hypertree) for any given weighed q-uniform hypergraph.

Affiliated with

Also associated with

No associations

Rating

The polynomial algorithm for optimal spanning hyperforest problem 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 The polynomial algorithm for optimal spanning hyperforest problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The polynomial algorithm for optimal spanning hyperforest problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131693