2 papers
math.CO2007
The polynomial algorithm for optimal spanning hyperforest problem
Alik Abakarov, Yuri Sushkov
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 giv…
math.OC2005
Global optimization: algorithms and software
A. Sh. Abakarov, Yu. A. Sushkov
This paper has been withdrawn by the author.