Using Cycles and Scaling in Parallel Algorithms

Stein, Clifford

Using Cycles and Scaling in Parallel Algorithms

Download

Name

MIT-LCS-TR-457.pdf

Size

2.33 MB

Format

Adobe PDF

Checksum (MD5)

033d05e042231d8949ae27d4c42bcb6f

Author(s)

Stein, Clifford

Advisor(s)

Shmoys, David

Date Issued

August 1989

Series/Report no.

MIT-LCS-TR-457

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.

Persistent DSpace Link

https://hdl.handle.net/1721.1/149682