Nondominated Coteries on Graphs

IEEE transactions on parallel and distributed systems 8 巻 6 号 667-672 頁 1997-06 発行
アクセス数 : 947
ダウンロード数 : 223

今月のアクセス数 : 3
今月のダウンロード数 : 0
ファイル情報(添付)
IEEE_1997_8_6_l0667.pdf 201 KB 種類 : 全文
タイトル ( eng )
Nondominated Coteries on Graphs
作成者
収録物名
IEEE transactions on parallel and distributed systems
8
6
開始ページ 667
終了ページ 672
抄録
Let C and D be two distinct coteries under the vertex set V of a graph G = (V, E) that models a distributed system. Coterie C is said to G-dominate D (with respect to G) if the following condition holds: For any connected subgraph H of G thatcontains a quorum in D (as a subset of its vertex set), there exists a connected subgraph H′ of H that contains a quorum in C. Acoterie C on a graph G is said to be G-nondominated (G-ND) (with respect to G) if no coterie D (≠ C) on G G-dominates C.Intuitively, a G-ND coterie consists of irreducible quorums. This paper characterizes G-ND coteries in graph theoretical terms, and presents a procedure for deciding whether or not a givencoterie C is G-ND with respect to a given graph G, based on this characterization. We then improve the time complexity of thedecision procedure, provided that the given coterie C is nondominated in the sense of Garcia-Molina and Barbara. Finally, wecharacterize the class of graphs G on which the majority coterie is G-ND.
著者キーワード
Terms-Availability
coteries on graphs
distributed mutual exclusion problem
G-nondominatedness
majority consensus
NDC分類
数学 [ 410 ]
言語
英語
資源タイプ 学術雑誌論文
出版者
IEEE
発行日 1997-06
権利情報
Copyright (c) 1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
出版タイプ Version of Record(出版社版。早期公開を含む)
アクセス権 オープンアクセス
収録物識別子
[ISSN] 1045-9219
[DOI] http://dx.doi.org/10.1109/71.595585 ~の異版である