Low-congestion shortcut and graph parameters

Distributed graph algorithms in the standard CONGEST model often exhibit the time-complexity lower bound of Ω ~ ( n + D ) rounds for several global problems, where n denotes the number of nodes and D the diameter of the input graph. Because such a lower bound is derived from special “hard-core” inst...

Full description

Saved in:

Bibliographic Details
Published in:	Distributed computing Vol. 34; no. 5; pp. 349 - 365
Main Authors:	Kitamura, Naoki, Kitagawa, Hirotaka, Otachi, Yota, Izumi, Taisuke
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2021 Springer Nature B.V
Subjects:	Algorithms Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Congestion Diameters Graph theory Lower bounds Network topologies Parameters Software Engineering/Programming and Operating Systems Theory of Computation Upper bounds Distributed graph algorithms Low-congestion shortcut Clique width chordal graph Minimum spanning tree
ISSN:	0178-2770, 1432-0452
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!