?
Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications
Vol. 14.
Cham :
Birkhäuser, 2021.
- Is published at every edition of EuroComb which is one of the leading conferences in the area worldwide
-
Presents the most recent achievements in this conference
-
Collects the extended abstracts of the accepted contributions to EuroComb21
Shabanov D. A., Zakharov P., , in : Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications. Vol. 14.: Cham : Birkhäuser, 2021. P. 817-822.
The paper deals with the max-cut problem for random hypergraphs. We consider a binomial model of a random k-uniform hypergraph H(n, k, p) for some fixed k≥3k≥3, growing n and p=p(n)p=p(n). For given natural number q, the max-q-cut for a hypergraph is the maximal possible number of edges that can be properly colored with q colors under the same coloring. Generalizing the known results for graphs ...
Added: September 8, 2021
М. : МАКС Пресс, 2017
The collection represents proceedings of the XVIII international conference “Problems of Theoretical Cybernetics” (Penza, 19–23 June, 2017), that is sponsored by Russian Foundation for Basic Research (project N 17-01-20217-г). The conference subject area includes: control systems synthesis, complexity, reliability, and diagnostics; automata; computer languages and programming; graph theory; combinatorics; coding theory; theory of pattern recognition; ...
Added: September 21, 2017
Springer, 2020
This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020.
The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including ...
Added: September 4, 2020
Sidorenko V., Чжо М. А., Алексеев В. М. et al., Электротехника 2017 № 12 С. 73-76
Планирование технического обслуживания (ТО) электроподвижного состава (ЭПС) в условиях ограниченных ресурсов может осуществляться на основе следующих критериев эаЬфективности построения графика оборота (ГО) ЭПС: — удовлетворение требований безопасности движения. обеспечиваемое путем коррекции планируемого времени движения ЭПС с целью недопустимости превышения времени между ТО над допустимым; — равномерность проведения ТО. Решение поставленной задачи с использованием теории графов ...
Added: January 16, 2018
М. : Изд-во механико-математического факультета МГУ, 2019
Сборник содержит материалы XII Международного семинара «Дискретная математика и ее приложения» имени академика О.Б. Лупанова, проходившего на механико-математическом факультете МГУ имени М. В. Ломоносова с 17 по 22 июня 2019 г. при поддержке Российского фонда фундаментальных исследований (проект 16–01–20345). Семинар охватывает следующие направления в области дискретной математики: теория функциональных систем, синтез, сложность и надежность управляющих ...
Added: October 17, 2019
М. : МАКС Пресс, 2015
The collection represents proceedings of the nineth international conference "Discrete Models in Control Systems Theory" that is held by Lomonosov Moscow State Uneversity and is dedicated in 90th anniversary of Sergey Vsevolodovich Yablonsky's birth. The conference subject are includes: discrete functional systems; discrete functions properties; control systems synthesis, complexity, reliability, and diagnostics; automata; graph theory; ...
Added: March 28, 2015
Meunier D., Pascarella A., Altukhov D. et al., Neuroimage 2020 Vol. 219 No. october P. 1-13
Recent years have witnessed a massive push towards reproducible research in neuroscience. Unfortunately, this endeavor is often challenged by the large diversity of tools used, project-specific custom code and the difficulty to track all user-defined parameters. NeuroPycon is an open-source multi-modal brain data analysis toolkit which provides Python-based template pipelines for advanced multi-processing of MEG, ...
Added: November 12, 2020
Artamonov S., Babenko M. A., European Journal of Combinatorics 2018 P. 3-23
A perfect 2-matching in an undirected graph G=(V,E) is a function x:E→0,1,2 such that for each node v∈V the sum of values x(e) on all edges e incident to v equals 2. If supp(x)=e∈E∣x(e)≠0 contains no triangles then x is called triangle-free. Polyhedrally speaking, triangle-free 2-matchings are harder than 2-matchings, but easier than usual 1-matchings. ...
Added: March 1, 2018
Kirill V. Efimov, Alina O. Tetereva, Ivanitsky A. et al., / arxiv.org. Series arXiv:submit/3445574 "arXiv:submit/3445574". 2020.
The analysis of the functional connectivity of brain sections associated with fear-conditioned training is one of the methods of study of memory neural networks. Before, the majority of studies focused on the functional connectivity of the brain regions that are data-driven for emotional education such as amygdalae and areas of the ventromedial prefrontal cortex in ...
Added: October 31, 2020
Gamard G., Richomme G., Shallit J. et al., Information Processing Letters 2017 Vol. 118 P. 58-63
Added: October 10, 2017
Gurvich V., Boros E., Kazuhisa M. et al., Discrete Applied Mathematics (Нидерланды) 2018 Vol. 239 P. 1-14
Moore's generalization of the game of Nim is played as follows. Given two integer parameters $n, k$ such that $1 \leq k \leq n$, and $n$ piles of tokens. Two players take turns. By one move a player reduces at least one and at most $k$ piles. The player who makes the last move wins. ...
Added: October 26, 2017
Sidorenko V., Уманский В. И., Чжо М. А. et al., Russian Electrical Engineering, Россия 2017 Vol. 88 No. 12 P. 839-841
Planning electric-rolling-stock (ERS) maintenance in conditions of limited resources can be carried out based on the following criteria of efficiency of construction of the cycle diagram of the electric rolling stock: meeting the requirements of the railway-traffic safety provided by adjusting the planned movement time of the electric rolling stock for the purpose of not ...
Added: March 8, 2018
Bogomolov F. A., Rovinsky M., Central European Journal of Mathematics 2013 Vol. 11 No. 1 P. 17-26
Let Ψ be the projectivization (i.e., the set of one-dimensional vector subspaces) of a vector space of dimension ≥ 3 over a field. Let H be a closed (in the pointwise convergence topology) subgroup of the permutation group GΨ of the set Ψ. Suppose that H contains the projective group and an arbitrary self-bijection of ...
Added: October 10, 2012
Pham S. K., Antipov D., Sirotkin Alexander et al., Journal of Computational Biology 2013 Vol. 20 No. 4 P. 359-371
One of the key advances in genome assembly that has led to a significant improvement in contig lengths has been improved algorithms for utilization of paired reads (mate-pairs). While in most assemblers, mate-pair information is used in a post-processing step, the recently proposed Paired de Bruijn Graph (PDBG) approach incorporates the mate-pair information directly in ...
Added: March 21, 2014
МГУ, МАКС Пресс, 2018
The proceedings of the tenth international conference "Discrete Models in Control Systems Theory" (Moscow and Moscow Region, May 23-25, 2018) includes 100 papers on such topics as discrete functional systems, properties of discrete functions, synthesis and complexity of control systems, reliability, control and diagnostics of control systems, automata, graph theory, combinatorics, coding theory, mathematical methods ...
Added: June 14, 2018
Springer, 2018
This book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully reviewed and selected from 69 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, ...
Added: October 23, 2018
М. : МАКС Пресс, 2017
The collection represents proceedings of the XVIII international conference “Problems of Theoretical Cybernetics” (Penza, 19–23 June, 2017), that is sponsored by Russian Foundation for Basic Research (project N 17-01-20217-г). The conference subject area includes: control systems synthesis, complexity, reliability, and diagnostics; automata; computer languages and programming; graph theory; combinatorics; coding theory; theory of pattern recognition; ...
Added: August 25, 2017
Rubchinskiy A., М. : Директ-Медиа, 2014
Предлагаемое пособие посвящено дискретным математическим моделям – в первую очередь, решению разнообразных стандартных задач, в которых надо что-то посчитать, найти, построить и т.д., но не доказать. Особое внимание уделяется технологии ручной реализации алгоритмов. Аудитория предполагаемого пособия вполне определена. Она состоит из студентов бакалавриата и магистратуры, обучающихся по специальностям, попадающим между точными, естественными и инженерными науками, ...
Added: October 20, 2017
NY : IEEE, 2016
This paper aims to tackle the problem of brain network classification with machine learning algorithms using spectra of networks’ matrices. Two approaches are discussed: first, linear and tree-based models are trained on the vectors of sorted eigenvalues of the adjacency matrix, the Laplacian matrix and the normalized Laplacian; next, SVM classifier is trained with kernels ...
Added: December 9, 2016
Moiseev S., Karpov I., Miftakhutdinova K. et al., Экономическая социология 2017 Т. 18 № 3 С. 152-159
A “Network Analysis” section was arranged at the XVIIIth Interna- tional Academic Conference on Economic and Social Development at the Higher School of Economics on 11–12 April 2017. For the third year, this section invited scholars from sociology, political science, management, mathematics, and linguistics who use network analysis in their research projects. During the sessions, ...
Added: September 16, 2017
М. : Изд-во механико-математического факультета МГУ, 2016
Сборник содержит материалы XII Международного семинара «Дискретная математика и ее приложения» имени академика О.Б. Лупанова, проходившего на механико-математическом факультете МГУ имени М. В. Ломоносова с 20 по 25 июня 2016 г. при поддержке Российского фонда фундаментальных исследований (проект 16–01–20345). Для студентов, аспирантов и научных работников в области дискретной математики и математической кибернетики. ...
Added: August 29, 2016
Springer, 2019
In this paper, we study the Maximum Happy Vertices and the Maximum Happy Edges problems (MHV and MHE for short). Very recently, the problems attracted a lot of attention and were studied in Agrawal ’17, Aravind et al. ’16, Choudhari and Reddy ’18, Misra and Reddy ’17. Main focus of our work is lower bounds on the computational complexity ...
Added: October 29, 2019
Shitov Y., Theoretical Computer Science 2017 Vol. 660 P. 102-104
Let G be a simple graph whose vertices are partitioned into two subsets, called ‘filled’ vertices and ‘empty’ vertices. A vertex v is said to be forced by a filled vertex u if v is a unique empty neighbor of u. If we can fill all the vertices of G by repeatedly filling the forced ones, then we call an initial set of filled vertices a ...
Added: December 19, 2016
Cham : Springer, 2021
This book constitutes the proceedings of the 20th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2021, held in Irkutsk, Russia, in July 2021.
The 29 full papers and 1 short paper presented in this volume were carefully reviewed and selected from 102 submissions. Additionally, 2 full invited papers are presented in the volume. ...
Added: July 8, 2021