Maximal internally stable set of a graph

Abstract

In constructing an algorithm for finding an m.i.s.s, o f a graph of large dimension (several thousand vertices) there arise problems in representing the whole graph in the operative memory of the digital computer. Usually, a graph of such dimension is constructed in accordance with a specific rule, and the size o f the program realizing this role is significantly smaller than the size (in the memory cells) o f the graph constructed by this program. In this connection, the following approach to the construction o f an algorithm for finding an m.i.s.s. is o f some interest.