RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika // Archive
Diskr. Mat., 1997 Volume 9, Issue 2, Pages 91–97 (Mi dm472)
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). $$


UDC: 519.1

Received: 16.11.1994

DOI: 10.4213/dm472


 English version: Discrete Mathematics and Applications, 1997, 7:3, 279–285

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024