Skip to main content
SpringerLink
Log in

Finding the largest internally stable sets of a graph by successive analysis of alternatives

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. R. Karp, “Reducibility among combinatorial problems,” in: R. E. Miller, J. W. Thatcher, and J. D. Bohlinger (editors), Complexity of Computer Computation, Plenum Press, New York (1972), pp. 85–103.

    Google Scholar 

  2. J. Weissman, “Boolean algebra, map coloring and interconnections,” Am. Math. Monthly,69, No. 7, 608–613 (1962).

    Google Scholar 

  3. Kh. Maghout, “Sur la determination des nombres de stabilité et du nombres chromatiques d'un graph,” C. R. Acad. Sci., No. 25, 3522–3523 (1959).

    Google Scholar 

  4. A. A. Zykov, Theory of Finite Graphs [in Russian], Nauka, Novosibirsk (1969).

    Google Scholar 

  5. I. G. Ilzinya, “Finding cliques,” Avtom. Vychisl. Tekh., No. 2, 7–11 (1967).

    Google Scholar 

  6. V. I. Ostrovskii and Yu. V. Pottosin, “Investigation of algorithms seeking maximal complete subgraphs in a symmetric graph,” Avtom. Vychisl. Tekh., No. 2, 19–26 (1970).

    Google Scholar 

  7. V. A. Trubin, “On a method of solving integer linear programming problems of special form,” Dokl. Akad. Nauk SSSR,189, No. 5, 952–954 (1969).

    Google Scholar 

  8. L. N. Zemlyanukhina, “An algorithm solving the problem of internally stable set,” in: Theory of Optimal Decisions [in Russian], Kiev (1973), pp. 75–84.

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

    Google Scholar 

  10. V. S. Mikhalevich, “Successive optimization algorithms and their application, I, II,” Kibernetika, No. 1, 45–65 (1965) No. 2, 85–88 (1965).

    Google Scholar 

  11. V. K. Zeidenberg, N. A. Matveenko, and E. V. Tarovatova, A Survey of Western Computer Technology as of 1968 [in Russian], Inst. Tochn. Mekh. Vychisl. Tekh., Moscow (1968).

    Google Scholar 

  12. A. A. Shelikhov and Yu. P. Selivanov, Computers: A Handbook [in Russian], Energiya, Moscow (1973).

    Google Scholar 

Download references

Authors
  1. S. N. Trushin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 33–41, September–October, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trushin, S.N. Finding the largest internally stable sets of a graph by successive analysis of alternatives. Cybern Syst Anal 16, 669–679 (1980). https://doi.org/10.1007/BF01078496

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01078496

Keywords

Search

Navigation