M Luby - SIAM Journal on Computing, 1986 - search.proquest.com
Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS) problem. The first strategy consists of assigning …
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo algorithm with a very local property. The local property of …
M LUBY - SIAM journal on computing (Print), 1986 - pascal-francis.inist.fr
A simple parallel algorithm for the maximal independent set problem CNRS Inist Pascal-Francis CNRS Pascal and Francis Bibliographic Databases Simple search Advanced search Search …
Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS) problem. The first strategy consists of assigning …
M Luby - SIAM Journal on Computing, 1986 - dl.acm.org
A simple parallel algorithm for the maximal independent set problem | SIAM Journal on Computing skip to main content ACM Digital Library home ACM home Google, Inc. (search) …
M LUBY - SIAM J. COMPUT, 1986 - scholar.archive.org
Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS) problem. The first strategy consists of assigning …
Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS) problem. The first strategy consists of assigning …
Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS) problem. The first strategy consists of assigning …
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo algorithm with a very local property. The local property of …