Identification Conditions for the Solvability of NP-complete Problems for the Class of Pre-fractal Graphs
Modern network systems (unmanned aerial vehicles groups, social networks, network production chains, transport and logistics networks, communication networks, cryptocurrency networks) are distinguished by their multi-element nature and the dynamics of connections between its elements. A number of di...
Saved in:
| Main Authors: | Aleksandr Vasil'evich Tymoshenko, Rasul Ahmatovich Kochkarov, Azret Ahmatovich Kochkarov |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2021-06-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1483 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
by: Alexander Valeryevich Smirnov
Published: (2021-03-01) -
1-Skeletons of the Spanning Tree Problems with Additional Constraints
by: V. A. Bondarenko, et al.
Published: (2015-08-01) -
On the surjectivity conditions of a linear functional differential operator of the second order
by: Eugene Bravyi
Published: (2025-04-01) -
Literature review for the topic of automation of scheduling classes and exams in higher education institutions
by: Wadhah M Al-Gabri
Published: (2017-03-01) -
Solving Edges Deletion Problem of Complete Graphs
by: Anwar N. Jasim, et al.
Published: (2024-12-01)