Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
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-05-07 16:40
Exploration of dynamic graphs by the minimum number of agents
Shunsuke Iitsuka (Osaka Univ.), Yuichi Sudo (Hosei Univ.), Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2021-3
Abstract (in Japanese) (See Japanese page) 
(in English) We consider the collaborative exploration of dynamic graphs by multiple agents, where dynamic graphs are defined as the ones whose edge set changes over (discrete) time, but the snapshot at each time is guaranteed to be connected. Our study focuses on the necessary and sufficient condition for the number of agents to attain the collaborative exploration in arbitrary dynamic graphs.


First, we prove that in $ell-$bounded dynamic graphs, where at most $ell$ edges can be disappeared at each time, $ell+1$ agents are necessarily to explore all vertices. Then, we propose the algorithm which achieves the exploration using $ell+1$ agents. The exploration time of the proposed algorithm is $O((8mn)^{ell+1})$, where $n$ is the number of vertices, and $m$ is the number of potential edges in dynamic graphs.
Keyword (in Japanese) (See Japanese page) 
(in English) mobile agent / exploration of dynamic graph / Rotor-Router / distributed algorithm / / / /  
Reference Info. IEICE Tech. Rep., vol. 121, no. 11, COMP2021-3, pp. 17-22, May 2021.
Paper # COMP2021-3 
Date of Issue 2021-04-30 (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-3

Conference Information
Committee COMP IPSJ-AL  
Conference Date 2021-05-07 - 2021-05-08 
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-05-COMP-AL 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Exploration of dynamic graphs by the minimum number of agents 
Sub Title (in English)  
Keyword(1) mobile agent  
Keyword(2) exploration of dynamic graph  
Keyword(3) Rotor-Router  
Keyword(4) distributed algorithm  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Shunsuke Iitsuka  
1st Author's Affiliation Osaka University (Osaka Univ.)
2nd Author's Name Yuichi Sudo  
2nd Author's Affiliation Hosei University (Hosei Univ.)
3rd Author's Name Taisuke Izumi  
3rd Author's Affiliation Osaka University (Osaka Univ.)
4th Author's Name Toshimitsu Masuzawa  
4th Author's Affiliation Osaka University (Osaka Univ.)
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 ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2021-05-07 16:40:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2021-3 
Volume (vol) vol.121 
Number (no) no.11 
Page pp.17-22 
#Pages 6 
Date of Issue 2021-04-30 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan