Research of NP-Complete Problems in the Class of Prefractal Graphs
NP-complete problems in graphs, such as enumeration and the selection of subgraphs with given characteristics, become especially relevant for large graphs and networks. Herein, particular statements with constraints are proposed to solve such problems, and subclasses of graphs are distinguished. We...
Main Author: | Rasul Kochkarov |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-10-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/21/2764 |
Similar Items
-
Multicriteria Optimization Problem on Prefractal Graph
by: Rasul Kochkarov
Published: (2022-03-01) -
Introduction to the Class of Prefractal Graphs
by: Rasul Kochkarov, et al.
Published: (2022-07-01) -
Structural recognition algorithm for prefractal graph
by: Irina H Utakaeva
Published: (2011-09-01) -
Towards the Solution of NP Complete Problems
by: Amit Kumar, et al.
Published: (2010-01-01) -
An Ultrasonic Lens Design Based on Prefractal Structures
by: Sergio Castiñeira-Ibáñez, et al.
Published: (2016-04-01)