The polynomial algorithm for optimal spanning hyperforest problem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Combinatorics, 05C65

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/125070

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0702757
 http://arxiv.org/abs/math/0702757

Collections

arXiv