Nondominated Coteries on Graphs
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00014151
ID | 14151 |
本文ファイル | |
著者 | |
キーワード | Terms-Availability
coteries on graphs
distributed mutual exclusion problem
G-nondominatedness
majority consensus
|
NDC |
数学
|
抄録(英) | 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.
|
掲載誌名 |
IEEE transactions on parallel and distributed systems
|
巻 | 8巻
|
号 | 6号
|
開始ページ | 667
|
終了ページ | 672
|
出版年月日 | 1997-06
|
出版者 | IEEE
|
ISSN | 1045-9219
|
言語 |
英語
|
NII資源タイプ |
学術雑誌論文
|
広大資料タイプ |
学術雑誌論文
|
DCMIタイプ | text
|
フォーマット | application/pdf
|
著者版フラグ | publisher
|
権利情報 | 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.
|
関連情報URL(IsVersionOf) | http://dx.doi.org/10.1109/71.595585
|
部局名 |
社会科学研究科
|