Realization of hypergraphs by trees of minimal diameter

Realization of hypergraphs by trees of minimal diameter

0.00 Avg rating0 Votes
Article ID: iaor20051508
Country: Belarus
Volume: 3
Start Page Number: 54
End Page Number: 57
Publication Date: Sep 2004
Journal: Proceedings of the National Academy of Sciences of Belarus, Series of Physical-Mathematical Sciences
Authors: ,
Abstract:

The algorithm which allows to construct the realization of hypergraphs by trees of minimal diameter with complexity O(min(|VH|,|EH|)|EH|∑ei∈EH|ei|) is proposed.

Reviews

Required fields are marked *. Your email address will not be published.