The polynomial algorithm for optimal spanning hyperforest problem
arXiv:math/0702757
Abstract
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.
7 pages, 2 figures