The polynomial algorithm for optimal spanning hyperforest problem

Simple item page
dc.creatorAbakarov, Alik
dc.creatorSushkov, Yuri
dc.date2007-02-26
dc.date2007-03-06
dc.date.accessioned2026-07-07T07:50:09Z
dc.date.available2026-07-07T07:50:09Z
dc.descriptionThis 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.
dc.description7 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0702757
dc.identifierhttp://arxiv.org/abs/math/0702757
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/125070
dc.subjectCombinatorics
dc.subject05C65
dc.titleThe polynomial algorithm for optimal spanning hyperforest problem
dc.typetext

Files

Collections

arXiv