Prikladnaya 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


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




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

Prikladnaya Diskretnaya Matematika, 2014, Number 2(24), Pages 79–87 (Mi pdm456)  
Applied Graph Theory

Analytic complexity of cluster trees

A. I. Normov, T. M. Sadykov

Plekhanov Russian State University of Economics, Moscow, Russia
Full-text PDF (1511 kB)
References:
PDF
HTML
Abstract: The notion of the analytic complexity of a binary tree is introduced. This is a nonnegative integer reflecting the combinatorial structure of a tree and its most concise analytic representation. The properties of the analytic complexity of a tree are described, and how to calculate it algorithmically is explained. The developed methods are used to compare cluster trees.
Keywords: cluster analysis, binary tree, analytic complexity.
Document Type: Article
UDC: 519.172.1+517.553
Language: Russian
Citation: A. I. Normov, T. M. Sadykov, “Analytic complexity of cluster trees”, Prikl. Diskr. Mat., 2014, no. 2(24), 79–87
Citation in format AMSBIB
\Bibitem{NorSad14}
\by A.~I.~Normov, T.~M.~Sadykov
\paper Analytic complexity of cluster trees
\jour Prikl. Diskr. Mat.
\yr 2014
\issue 2(24)
\pages 79--87
\mathnet{http://mi.mathnet.ru/pdm456}
Linking options:
  • https://www.mathnet.ru/eng/pdm456
  • https://www.mathnet.ru/eng/pdm/y2014/i2/p79
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:486
    Full-text PDF :160
    References:82
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024