A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness

Dantas, Simone; Figueiredo, Celina M. H. de; Petito, Priscila; Teixeira, Ricardo Rodrigues

doi:10.1016/j.entcs.2019.08.035

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For solving NP-complete problems, it is customary to define subclasses of graphs for which solvability conditions are possible. Another approach is the formulation of particular problems with additional restrictions [8][9][10]. NP-complete problems are explored in various subject areas to find solutions to applied problems [11][12][13].…”

Section: Introductionmentioning

confidence: 99%

Research of NP-Complete Problems in the Class of Prefractal Graphs

Kochkarov

2021

Mathematics

View full text Add to dashboard Cite

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 propose a class of prefractal graphs and review particular statements of NP-complete problems. As an example, algorithms for searching for spanning trees and packing bipartite graphs are proposed. The developed algorithms are polynomial and based on well-known algorithms and are used in the form of procedures. We propose to use the class of prefractal graphs as a tool for studying NP-complete problems and identifying conditions for their solvability. Using prefractal graphs for the modeling of large graphs and networks, it is possible to obtain approximate solutions, and some exact solutions, for problems on natural objects—social networks, transport networks, etc.

show abstract

Section: Introductionmentioning

confidence: 99%

Research of NP-Complete Problems in the Class of Prefractal Graphs

Kochkarov

2021

Mathematics

View full text Add to dashboard Cite

show abstract

A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness

Cited by 1 publication

References 9 publications

Research of NP-Complete Problems in the Class of Prefractal Graphs

Research of NP-Complete Problems in the Class of Prefractal Graphs

Contact Info

Product

Resources

About