Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Algorithm of determination of largest internally stable set of a graph

  • 15 Accesses

This is a preview of subscription content, log in to check access.

Literature Cited

  1. 1.

    G. Nemhauser and L. Trotter, “Vertex packing, structural properties and algorithms,” Math. Program.,8, No. 2, 232–248 (1975).

  2. 2.

    S. N. Trushin, “Determination of largest internally stable sets of a graph by sequential analysis of versions,” Kibernetika, No. 5, 33–41 (1980).

  3. 3.

    D. J. Houck and R. R. Vemuganti, “An algorithm for the vertex packing problem,” Operat. Res.,25, No. 5, 773–787 (1977).

  4. 4.

    E. Balas and H. Samuelsson, “A node covering algorithm,” Nav. Res. Log. Q.,24, No. 2, 213–233 (1977).

  5. 5.

    R. Karp, “Reducibility of combinatorial problems,” Kibern. Sb., Nov. Ser., No. 12, 16–38 (1975).

  6. 6.

    A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).

  7. 7.

    S. N. Trushin, “On finding the largest internally stable set of a graph,” Kibernetika, No. 1, 23–29 (1982).

  8. 8.

    V. L. Ostrovskii and Yu. V. Pottosin, “Study of algorithms of search for maximal complete subgraphs in a symmetric graph,” Avtomat. Vychisl. Tekh., No. 2, 19–26 (1970).

  9. 9.

    V. S. Mikhalevich, N. Z. Shor, et al., Computational Methods of Selection of Optimal Design Solutions [in Russian], Naukova Dumka, Kiev (1977).

  10. 10.

    V. K. Zeidenberg, N. A. Matveenko, and E. V. Tarovatova, Review of Foreign Computer Technology According to Its State in 1968 [in Russian], Publ. Inst. Precision Mechanics and Computer Technology, Moscow (1968).

  11. 11.

    O. V. Dobronevskii, Ya. P. Borokhovich, and K. V. Samchenko, Handbook for Electronic Computers [in Russian], Vyshcha Shkola, Kiev (1976).

Download references

Additional information

Translated from Kibernetika, No. 2, pp. 14–24, March–April, 1982.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Trushin, S.N. Algorithm of determination of largest internally stable set of a graph. Cybern Syst Anal 18, 158–171 (1982). https://doi.org/10.1007/BF01074525

Download citation


  • Operating System
  • Artificial Intelligence
  • System Theory