Analysis of the impact of the number of edges in connected graphs on the computational complexity of the independent set problem

Under study is the complexity status of the independent set problem in a class of connected graphs that are defined by functional constraints on the number of edges depending on the number of vertices. For every natural number C , this problem is shown to be polynomially solvable in the class of gra...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of applied and industrial mathematics Jg. 6; H. 1; S. 97 - 99
1. Verfasser:	Malyshev, D. S.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Dordrecht SP MAIK Nauka/Interperiodica 01.01.2012 Springer Nature B.V
Schlagworte:	Algorithms Complexity Computation Computational mathematics Exponents Graphs Intersections Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Set theory Studies computational complexity independent set problem
ISSN:	1990-4789, 1990-4797
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!