Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretnaya Matematika, 1997, Volume 9, Issue 2, Pages 91–97
DOI: https://doi.org/10.4213/dm472
(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). $$
Received: 16.11.1994
Bibliographic databases:
UDC: 519.1
Language: Russian
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
Citation in format AMSBIB
\Bibitem{Mel97}
\by O.~I.~Mel'nikov
\paper Realization of hypergraphs by trees of minimal diameter
\jour Diskr. Mat.
\yr 1997
\vol 9
\issue 2
\pages 91--97
\mathnet{http://mi.mathnet.ru/dm472}
\crossref{https://doi.org/10.4213/dm472}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1468074}
\zmath{https://zbmath.org/?q=an:0965.05076}
\transl
\jour Discrete Math. Appl.
\yr 1997
\vol 7
\issue 3
\pages 279--285
Linking options:
  • https://www.mathnet.ru/eng/dm472
  • https://doi.org/10.4213/dm472
  • https://www.mathnet.ru/eng/dm/v9/i2/p91
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:492
    Full-text PDF :302
    First page:2
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024