D. S. Malyshev, “The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem”, Diskr. Mat., 2013, Volume 25, Issue 2,Pages <nobr>63

JOURNALS // Diskretnaya Matematika // Archive

Diskr. Mat., 2013 Volume 25, Issue 2, Pages 63–67 (Mi dm1234)

This article is cited in 4 papers

The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem

D. S. Malyshev

UDC: 519.178

Received: 23.05.2011

DOI: 10.4213/dm1234

Fulltext: PDF file (147 kB)
References
Cited by

English version: Discrete Mathematics and Applications, 2013, 23:3-4, 245–249

Bibliographic databases: