title: Modification of Robson's algorithm for finding maximum independent set in undirected graph
metadata.name: dc.contributor.author
metadata.value: Firyulina, Oksana Sergeevna
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Olemskoy, Igor Vladimirovich
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2016-04-08T13:03:49Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2016-04-08T13:03:49Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2015
metadata.lang: -
metadata.name: dc.identifier.other
metadata.value: DOI: 10.1109/SCP.2015.7342131
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/2011
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: 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
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: en
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: Institute of Electrical and Electronics Engineers
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: MAXIMUM INDEPENDENT SET, ROBSON'S ALGORITHM
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Modification of Robson's algorithm for finding maximum independent set in undirected graph
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: IEEE Xplore Full-Text PDF.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/2011/1/IEEE%20Xplore%20Full-Text%20PDF.pdf
resources.format: Adobe PDF
resources.description: Основная статья
resources.size: 207,68 kB