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

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


Diskretn. Anal. Issled. Oper., 2015, Volume 22, Number 6, Pages 29–42 (Mi da831)  

This article is cited in 1 scientific paper (total in 1 paper)

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

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


DOI: https://doi.org/10.17377/daio.2015.22.509

Full text: PDF file (272 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 519.176
Received: 08.09.2015
Revised: 12.10.2015

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://www.ams.org/mathscinet-getitem?mr=3497821}
\elib{http://elibrary.ru/item.asp?id=25124388}


Linking options:
  • http://mi.mathnet.ru/eng/da831
  • http://mi.mathnet.ru/eng/da/v22/i6/p29

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. O. G. Monakhov, E. A. Monakhova, “A parallel algorithm of the multivariant evolutionary synthesis of nonlinear models”, Num. Anal. Appl., 10:2 (2017), 140–148  mathnet  crossref  crossref  isi  elib
  • ƒискретный анализ и исследование операций
    Number of views:
    This page:155
    Full text:46
    References:26
    First page:4

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020