<technical report>
A Parallel Algorithm for the Maximum 2-Chain Edge Packing Problem
Creator | |
---|---|
Language | |
Publisher | |
Date | |
Source Title | |
Vol | |
Publication Type | |
Access Rights | |
Related DOI | |
Related URI | |
Relation | |
Abstract | We present a parallel algorithm for finding a maximum 2-chain edge packing of an undirected graph G = (V,E). It runs in O(log n) time using O(n+m) processors on a CRCW PRAM, where $ n= mid V mid and m... = mid Emid $.show more |
Hide fulltext details.
File | FileType | Size | Views | Description |
---|---|---|---|---|
rifis-tr-9 | 665 KB | 525 |
Details
Record ID | |
---|---|
Peer-Reviewed | |
Subject Terms | |
Notes | |
Type | |
Created Date | 2009.04.22 |
Modified Date | 2017.01.20 |