Skip to main content
SpringerLink
Log in

Maximal internally stable set of a graph

  • 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. A. A. Borovikov and V. A. Gorbatov, “A criterion for coloring the vertices of a graph,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4 (1972).

  2. S. M. Starobinets, “On an algorithm for finding a maximal internally stable set of a graph,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 5 (1972).

  3. A. N. Chebotarev, “Synthesis of an automaton by a set of microprograms,” Kibernetika, No. 3 (1968).

  4. B. D. Ginzburg, P. A. Balagushkina, G. M. Dodin, I. A. Kholodova, and B. B. Shtabnitskaya, “Fundamental algorithms for a system of automated design of a printed assembly,” Vopr. Radioelektroniki, Ser. EVT, No. 3 (1972).

  5. C. Berge, The Theory of Graphs and Its Applications [Russian translation], Izd. Inostr. Lit., Moscow (1962).

    Google Scholar 

Download references

Authors
  1. S. M. Starobinets
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 61–63, March–April, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Starobinets, S.M. Maximal internally stable set of a graph. Cybern Syst Anal 11, 244–246 (1975). https://doi.org/10.1007/BF01069865

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation