A faster implementation of a parallel tree contraction scheme and its application an distance-hereditary graphs

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > journal & Dissertation > Item 987654321/32282

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/32282

Title:	A faster implementation of a parallel tree contraction scheme and its application an distance-hereditary graphs
Authors:	Hsieh,SY;Ho,CW;Hsu,TS;Ko,MT;Chen,GH
Contributors:	資訊工程研究所
Keywords:	CHORDAL GRAPHS;ALGORITHMS;DOMINATION;RECOGNITION
Date:	2000
Issue Date:	2010-07-06 18:23:06 (UTC+8)
Publisher:	中央大學
Abstract:	We consider a parallel tree contraction scheme which in each contraction phase removes leaves and nodes in the maximal chains. Let T(n) and P(n) denote the time and processor complexity required Co compute the all nearest smaller values (ANSV) and the min
Relation:	JOURNAL OF ALGORITHMS
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	553	View/Open

社群 sharing