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

2015 International Conference "Stability and Control Processes" in Memory of V.I. Zubov (SCP) Pub Date : 2015-12-03 DOI:10.1109/SCP.2015.7342131

I. V. Olemskoy, O. S. Firyulina

引用次数: 2

Abstract

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.

查看原文本刊更多论文

无向图中求最大独立集的Robson算法的改进

研究了求无向图中最大独立顶点集的问题。提出了确定最大独立集元素的Robson算法的改进。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2015 International Conference "Stability and Control Processes" in Memory of V.I. Zubov (SCP)

自引率

0.00%

发文量