Modification of Robson's algorithm for finding maximum independent set in undirected graph

Igor V. Olemskoy, Oksana S. Firyulina · 2015

The problem of finding the maximum independent set of vertices in an undirected graph is considered. The modification of Robson's algorithm for determining the elements of maximum independent set is proposed.

Read the paper · More papers on PaperTik