| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2021-10-23 14:30 Algorithms for Graph Class Identification Problems in the Population Protocol Model Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue (NAIST)  COMP2021-17 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | In this paper, we focus on graph class identification problems in the population protocol model. A graph class identification problem aims to decide whether a given communication graph is in the desired class (e.g. whether the given communication graph is a ring graph). Angluin et al. proposed graph class identification protocols with directed graphs and designated initial states under global fairness [Angluin et al., DCOSS2005]. We consider graph class identification problems for undirected graphs on various assumptions such as initial states of agents, fairness of the execution, and initial knowledge of agents. In particular, we focus on lines, rings, $k$-regular graphs, stars, trees, bipartite graphs, and complete graphs. With designated initial states, we propose graph class identification protocols for $k$-regular graphs, trees, and complete graphs under global fairness, and propose graph class identification protocols for stars and complete graphs under weak fairness with knowledge of the number of agents $n$. Moreover, we show that, even if agents know the number of agents $n$, there is no graph class identification protocol for lines, rings, $k$-regular graphs, trees, or bipartite graphs under weak fairness. On the other hand, with arbitrary initial states, we show that there is no graph class identification protocol for lines, rings, $k$-regular graphs, stars, trees, bipartite graphs, or complete graphs. |
|
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | population protocol / graph class identification / distributed protocol / / / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 121, no. 218, COMP2021-17, pp. 20-27, Oct. 2021. | |
| Paper # | COMP2021-17 | |
| Date of Issue | 2021-10-16 (COMP) | |
| ISSN | Online edition: ISSN 2432-6380 | |
| Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) | |
| Download PDF | COMP2021-17 |
|
| Conference Information | |
| Committee | COMP |
| Conference Date | 2021-10-23 - 2021-10-23 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Paper Information | |
| Registration To | COMP |
| Conference Code | 2021-10-COMP |
| Language | English |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Algorithms for Graph Class Identification Problems in the Population Protocol Model |
| Sub Title (in English) | |
| Keyword(1) | population protocol |
| Keyword(2) | graph class identification |
| Keyword(3) | distributed protocol |
| Keyword(4) | |
| Keyword(5) | |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Hiroto Yasumi |
| 1st Author's Affiliation | Nara Institute of Science and Technology (NAIST) |
| 2nd Author's Name | Fukuhito Ooshita |
| 2nd Author's Affiliation | Nara Institute of Science and Technology (NAIST) |
| 3rd Author's Name | Michiko Inoue |
| 3rd Author's Affiliation | Nara Institute of Science and Technology (NAIST) |
| 4th Author's Name | |
| 4th Author's Affiliation | () |
| 5th Author's Name | |
| 5th Author's Affiliation | () |
| 6th Author's Name | |
| 6th Author's Affiliation | () |
| 7th Author's Name | |
| 7th Author's Affiliation | () |
| 8th Author's Name | |
| 8th Author's Affiliation | () |
| 9th Author's Name | |
| 9th Author's Affiliation | () |
| 10th Author's Name | |
| 10th Author's Affiliation | () |
| 11th Author's Name | |
| 11th Author's Affiliation | () |
| 12th Author's Name | |
| 12th Author's Affiliation | () |
| 13th Author's Name | |
| 13th Author's Affiliation | () |
| 14th Author's Name | |
| 14th Author's Affiliation | () |
| 15th Author's Name | |
| 15th Author's Affiliation | () |
| 16th Author's Name | |
| 16th Author's Affiliation | () |
| 17th Author's Name | |
| 17th Author's Affiliation | () |
| 18th Author's Name | |
| 18th Author's Affiliation | () |
| Speaker | Author-1 |
| Date Time | 2021-10-23 14:30:00 |
| Presentation Time | 35 minutes |
| Registration for | COMP |
| Paper # | COMP2021-17 |
| Volume (vol) | vol.121 |
| Number (no) | no.218 |
| Page | pp.20-27 |
| #Pages | 8 |
| Date of Issue | 2021-10-16 (COMP) |
[Return to Top Page]