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, 2015, Number 3(29), Pages 74–82
DOI: https://doi.org/10.17223/20710410/29/6 (Mi pdm513) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Applied Graph Theory

Evolutionarily-fragmented algorithm for finding a maximal flat part of a graph

I. V. Kozin, S. V. Kurapov, S. I. Poljuga

Zaporizhzhya National University, Zaporizhzhya, Ukraine
Full-text PDF (647 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.17223/20710410/29/6
Abstract: The problem of finding a maximal flat part of a separable undirected graph is considered. It is shown that this problem can be represented as an optimization problem on a fragmented structure. An evolutionary-fragmented algorithm for finding approximate solutions of the problem is proposed.
Keywords: graph, maximally flat part of graph, isometric cycles, fragmented structure, evolutionarily-fragmented algorithm.
Bibliographic databases:
Document Type: Article
UDC: 519.172
Language: Russian
Citation: I. V. Kozin, S. V. Kurapov, S. I. Poljuga, “Evolutionarily-fragmented algorithm for finding a maximal flat part of a graph”, Prikl. Diskr. Mat., 2015, no. 3(29), 74–82
Citation in format AMSBIB
\Bibitem{KozKurPol15}
\by I.~V.~Kozin, S.~V.~Kurapov, S.~I.~Poljuga
\paper Evolutionarily-fragmented algorithm for finding a~maximal flat part of a~graph
\jour Prikl. Diskr. Mat.
\yr 2015
\issue 3(29)
\pages 74--82
\mathnet{http://mi.mathnet.ru/pdm513}
\crossref{https://doi.org/10.17223/20710410/29/6}
Linking options:
  • https://www.mathnet.ru/eng/pdm513
  • https://www.mathnet.ru/eng/pdm/y2015/i3/p74
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:118
    Full-text PDF :78
    References:41
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024