The polynomial algorithm for optimal spanning hyperforest problem
Combinatorics
2007-05-23 v2
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.
Cite
@article{arxiv.math/0702757,
title = {The polynomial algorithm for optimal spanning hyperforest problem},
author = {Alik Abakarov and Yuri Sushkov},
journal= {arXiv preprint arXiv:math/0702757},
year = {2007}
}
Comments
7 pages, 2 figures