DocumentCode
3701429
Title
Modification of Robson´s algorithm for finding maximum independent set in undirected graph
Author
Igor V. Olemskoy;Oksana S. Firyulina
Author_Institution
Saint Petersburg State University, 7/9 Universitetskaya nab., 199034, Russia
fYear
2015
Firstpage
332
Lastpage
334
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.
Keywords
"Computer science","Electronic mail","Graph theory","NP-complete problem","Polynomials","Estimation"
Publisher
ieee
Conference_Titel
"Stability and Control Processes" in Memory of V.I. Zubov (SCP), 2015 International Conference
Type
conf
DOI
10.1109/SCP.2015.7342131
Filename
7342131
Link To Document