Using Cycles and Scaling in Parallel Algorithms
| dc.contributor.advisor | Shmoys, David | en_US |
| dc.contributor.author | Stein, Clifford | en_US |
| dc.date.accessioned | 2023-03-29T15:16:26Z | |
| dc.date.available | 2023-03-29T15:16:26Z | |
| dc.date.issued | 1989-08 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149682 | |
| dc.description.abstract | We introduce the technique of decomposing an undirected graph by finding a maximal set of edge-disjoint cycles. We give a parallel algorithm to find this decomposition in O(log n) time on (m+ n)/log n processors. We then use this decomposition to to give the first efficient parallel algorithm for finding an approximation to a minimum cycle cover. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-457 | |
| dc.title | Using Cycles and Scaling in Parallel Algorithms | en_US |
| dc.identifier.oclc | 20900185 |
