WEKO3
アイテム
Nondominated Coteries on Graphs
https://hiroshima.repo.nii.ac.jp/records/2007037
https://hiroshima.repo.nii.ac.jp/records/200703723e2df02-dafe-4f9a-b4c8-4b5b98b5b54d
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IEEE_1997_8_6_l0667.pdf (201.4 KB)
|
| Item type | デフォルトアイテムタイプ_（フル）(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2023-03-18 | |||||||||
| タイトル | ||||||||||
| タイトル | Nondominated Coteries on Graphs | |||||||||
| 言語 | en | |||||||||
| 作成者 |
Harada, Takashi
× Harada, Takashi
× Yamashita, Masafumi
|
|||||||||
| アクセス権 | ||||||||||
| アクセス権 | open access | |||||||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||||||
| 権利情報 | ||||||||||
| 権利情報 | 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. | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | Terms-Availability | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | coteries on graphs | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | distributed mutual exclusion problem | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | G-nondominatedness | |||||||||
| 主題 | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | majority consensus | |||||||||
| 主題 | ||||||||||
| 主題Scheme | NDC | |||||||||
| 主題 | 410 | |||||||||
| 内容記述 | ||||||||||
| 内容記述 | 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. | |||||||||
| 言語 | en | |||||||||
| 出版者 | ||||||||||
| 出版者 | IEEE | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 出版タイプ | ||||||||||
| 出版タイプ | VoR | |||||||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||||
| 関連情報 | ||||||||||
| 関連タイプ | isVersionOf | |||||||||
| 識別子タイプ | DOI | |||||||||
| 関連識別子 | http://dx.doi.org/10.1109/71.595585 | |||||||||
| 収録物識別子 | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1045-9219 | |||||||||
| 開始ページ | ||||||||||
| 開始ページ | 667 | |||||||||
| 書誌情報 |
IEEE transactions on parallel and distributed systems IEEE transactions on parallel and distributed systems 巻 8, 号 6, p. 667-672, 発行日 1997-06 |
|||||||||
| 旧ID | 14151 | |||||||||
