Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/37804
DC FieldValueLanguage
dc.contributor.authorLiu, C.M.en_US
dc.contributor.author余明興zh_TW
dc.contributor.authorYu, M.S.en_US
dc.date1998zh_TW
dc.date.accessioned2014-06-06T08:00:08Z-
dc.date.available2014-06-06T08:00:08Z-
dc.identifier.issn0166-218Xzh_TW
dc.identifier.urihttp://hdl.handle.net/11455/37804-
dc.description.abstractA 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.en_US
dc.language.isoen_USzh_TW
dc.relationDiscrete Applied Mathematicsen_US
dc.relation.ispartofseriesDiscrete Applied Mathematics, Volume 87, Issue 1-3, Page(s) 187-201.en_US
dc.subjecttreesen_US
dc.subjectpathwidthen_US
dc.subjecttreewidthen_US
dc.subjecttimeen_US
dc.titleAn optimal parallel algorithm for node ranking of cographsen_US
dc.typeJournal Articlezh_TW
Appears in Collections:資訊科學與工程學系所
文件中的檔案:

取得全文請前往華藝線上圖書館



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.