Please use this identifier to cite or link to this item:
|標題:||An optimal parallel algorithm for node ranking of cographs||作者:||Liu, C.M.
|關鍵字:||trees;pathwidth;treewidth;time||Project:||Discrete Applied Mathematics||期刊/報告no：:||Discrete Applied Mathematics, Volume 87, Issue 1-3, Page(s) 187-201.||摘要:||
A ranking of a graph G is a mapping, rho, from the vertices of G to the natural numbers such that for every path between any two vertices u and v, u not equal u, with rho(u) = rho(v), there exists at least one vertex w on that path with rho(w)> rho(u)= rho(v). The value rho(v) of a vertex v is the rank of vertex v. A ranking is optimal if the largest rank assigned is the smallest among all rankings. The optimal ranking problem on a graph G is the problem of finding an optimal ranking on G. We persent a parallel algorithm which needs O(log n) time and nl log n processors on the EREW PRAM model for this problem on cographs. (C) 1998 Elsevier Science B.V. All rights reserved.
|Appears in Collections:||資訊科學與工程學系所|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.