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, 2011, supplement № 4, Pages 94–96 (Mi pdm310)  
Applied Graph Theory

Compact graphs and the deterministic algorithm for their synthesis

V. A. Melent'ev

Institute of Semiconductor Physics of SB RAS, Novosibirsk
Full-text PDF (418 kB)
References:
PDF
HTML
Abstract: Compact structures of computational systems are defined as regular graphs with the minimum diameter. A method for synthesis of compact graphs using the representation of the graph by a set of its vertex-complete projections with the minimally possible number of levels is described.
Document Type: Article
UDC: 519.17+681.3
Language: Russian
Citation: V. A. Melent'ev, “Compact graphs and the deterministic algorithm for their synthesis”, Prikl. Diskr. Mat., 2011, supplement № 4, 94–96
Citation in format AMSBIB
\Bibitem{Mel11}
\by V.~A.~Melent'ev
\paper Compact graphs and the deterministic algorithm for their synthesis
\jour Prikl. Diskr. Mat.
\yr 2011
\pages 94--96
\issueinfo supplement № 4
\mathnet{http://mi.mathnet.ru/pdm310}
Linking options:
  • https://www.mathnet.ru/eng/pdm310
  • https://www.mathnet.ru/eng/pdm/y2011/i13/p94
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024