The polynomial algorithm for optimal spanning hyperforest problem
组合数学
2007-05-23 v2
摘要
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.
引用
@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}
}
备注
7 pages, 2 figures