A Parallel Algorithm for the Maximum 2-Chain Edge Packing Problem - Collections

＜technical report＞
A Parallel Algorithm for the Maximum 2-Chain Edge Packing Problem

Creator	Creator Name Shiraishi, Shuji 白石, 修二 Affiliation Affiliation Name Department of Applied Mathematics Fukuoka University 福岡大学理学部応用数学科
Language	English
Publisher	Research Institute of Fundamental Information Science, Kyushu University
Publisher	九州大学理学部附属基礎情報学研究施設
Date	1988-12-26
Source Title	RIFIS Technical Report
Vol	9
Publication Type	Accepted Manuscript
Access Rights	open access
Related DOI	RIFIS Technical Report \|\| 9 \|\| p1-6
Related DOI	http://www.i.kyushu-u.ac.jp/research/report.html
Related URI	RIFIS Technical Report \|\| 9 \|\| p1-6
Related URI	http://www.i.kyushu-u.ac.jp/research/report.html
Relation	RIFIS Technical Report \|\| 9 \|\| p1-6
Relation	http://www.i.kyushu-u.ac.jp/research/report.html
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

File	FileType	Size	Views	Description
rifis-tr-9	pdf	665 KB	490

Record ID	3115
Peer-Reviewed	Unrefereed
Subject Terms	2-chain edge packing
	Euler tour technique
	parallel algorithm
Notes	Information Processing Letters 32, 277-279, 1989
Type	テクニカルレポート
Created Date	2009.04.22
Modified Date	2017.01.20