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
-
Quantum Feasibility Labeling for NP-Complete Vertex Coloring Problem
by: Junpeng Zhan
Published: (2025-01-01) -
A special machine for solving NP-complete problems
by: Jin Xu, et al.
Published: (2025-07-01) -
Some results on π-solvable and supersolvable groups
by: T. K. Dutta, et al.
Published: (1994-01-01) -
NP-completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem
by: Natalya Sergeevna Medvedeva, et al.
Published: (2019-09-01) -
On the solvability of the Sturm – Liouville problem, nonlinear in the spectral parameter
by: G.V. Chalyshov
Published: (2025-03-01)