|
Realization of hypergraphs by trees of minimal diameter
O. I. Mel'nikov
Abstract:
We suggest an algorithm of constructing a realization of a hypergraph
$H=(VH,EH)$ by a tree of minimal diameter whose complexity is
$$
O\Bigl(\max\Bigl(|VH|^3,|VH|\sum_{e_i\in EH} |e^i|^2\Bigr)\Bigr).
$$
Received: 16.11.1994
Citation:
O. I. Mel'nikov, “Realization of hypergraphs by trees of minimal diameter”, Diskr. Mat., 9:2 (1997), 91–97; Discrete Math. Appl., 7:3 (1997), 279–285
Linking options:
https://www.mathnet.ru/eng/dm472https://doi.org/10.4213/dm472 https://www.mathnet.ru/eng/dm/v9/i2/p91
|
Statistics & downloads: |
Abstract page: | 492 | Full-text PDF : | 302 | First page: | 2 |
|