Paper Abstract and Keywords |
Presentation |
2022-05-19 15:40
On Time Complexity of Distributed Minimum Spanning Tree Construction in the broadcast-CONGEST model for Restricted Graph Classes Narumi Shigekiyo, Toshimitsu Masuzawa, Taisuke Izumi (Osaka Univ.) COMP2022-5 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
Broadcast-CONGEST is a variant of CONGEST, the standard computational model for distributed graph algorithms, with the restriction that only a common message can be sent to all neighbors in each round. We give the lower bound on the minimum spanning tree problem for restricted graph classes in the broadcast-CONGEST model. While planar graphs admit an efficient MST algorithm running in $tilde{Omega}(D)$ rounds in the standard CONGEST model, it does not hold in the broadcast-CONGEST model. We show that the minimum spanning tree problem for planar graphs in the broadcast-CONGEST model is as expensive as the general case, which exhibits the lower bound of $tilde{Omega}(sqrt{n} + D)$ rounds. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
broadcast-CONGEST model / planar graph / minimum spanning tree construction / time complexity / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 122, no. 33, COMP2022-5, pp. 33-38, May 2022. |
Paper # |
COMP2022-5 |
Date of Issue |
2022-05-12 (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 |
COMP2022-5 |
Conference Information |
Committee |
COMP IPSJ-AL |
Conference Date |
2022-05-19 - 2022-05-20 |
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 |
2022-05-COMP-AL |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
On Time Complexity of Distributed Minimum Spanning Tree Construction in the broadcast-CONGEST model for Restricted Graph Classes |
Sub Title (in English) |
|
Keyword(1) |
broadcast-CONGEST model |
Keyword(2) |
planar graph |
Keyword(3) |
minimum spanning tree construction |
Keyword(4) |
time complexity |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Narumi Shigekiyo |
1st Author's Affiliation |
Osaka University (Osaka Univ.) |
2nd Author's Name |
Toshimitsu Masuzawa |
2nd Author's Affiliation |
Osaka University (Osaka Univ.) |
3rd Author's Name |
Taisuke Izumi |
3rd Author's Affiliation |
Osaka University (Osaka Univ.) |
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 |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2022-05-19 15:40:00 |
Presentation Time |
35 minutes |
Registration for |
COMP |
Paper # |
COMP2022-5 |
Volume (vol) |
vol.122 |
Number (no) |
no.33 |
Page |
pp.33-38 |
#Pages |
6 |
Date of Issue |
2022-05-12 (COMP) |
|