Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 2015, Volume 22, Issue 6, Pages 29–42
DOI: https://doi.org/10.17377/daio.2015.22.509 (Mi da831) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Searching for record circulant graphs using a parallel genetic algorithm

E. A. Monakhova, O. G. Monakhov

Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 6 Lavrentiev Ave., 630090 Novosibirsk, Russia
Full-text PDF (272 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2015.22.509
Abstract: We consider the Degree/Diameter problem for circulants – the problem of constructing large undirected circulant graphs (networks) with given degree and diameter. We develop a genetic algorithm for synthesis of large circulant graphs and implement its parallel version by supercomputer systems. The algorithm has found 28 new large circulant graphs which orders are better than the largest of the current known circulants from the record $(\Delta/D)$-circulant graphs table for degrees $12\le\Delta\le16$ and diameters $4\le D\le10$. Tab. 2, bibliogr. 29.
Keywords: undirected circulant graph, Degree/Diameter problem, network design, genetic algorithm.
Funding agency Grant number
Russian Foundation for Basic Research 14-01-00031
Received: 08.09.2015
Revised: 12.10.2015
Bibliographic databases:
Document Type: Article
UDC: 519.176
Language: Russian
Citation: E. A. Monakhova, O. G. Monakhov, “Searching for record circulant graphs using a parallel genetic algorithm”, Diskretn. Anal. Issled. Oper., 22:6 (2015), 29–42
Citation in format AMSBIB
\Bibitem{MonMon15}
\by E.~A.~Monakhova, O.~G.~Monakhov
\paper Searching for record circulant graphs using a~parallel genetic algorithm
\jour Diskretn. Anal. Issled. Oper.
\yr 2015
\vol 22
\issue 6
\pages 29--42
\mathnet{http://mi.mathnet.ru/da831}
\crossref{https://doi.org/10.17377/daio.2015.22.509}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3497821}
\elib{https://elibrary.ru/item.asp?id=25124388}
Linking options:
  • https://www.mathnet.ru/eng/da831
  • https://www.mathnet.ru/eng/da/v22/i6/p29
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:321
    Full-text PDF :89
    References:54
    First page:4
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024