Low-Congestion Shortcuts without Embedding

DOI10.1145/2933057.2933112zbMath1375.68200OpenAlexW3104014862MaRDI QIDQ5361969

Bernhard Haeupler, Goran Zuzic, Taisuke Izumi

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2933057.2933112

zbMATH Keywords

MSTplanar graphsbounded-genus graphscongest modellow-congestion shortcuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (6)

Property testing of planarity in the \textsf{CONGEST} model ⋮ Low-congestion shortcuts without embedding ⋮ Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts ⋮ Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications ⋮ Low-congestion shortcut and graph parameters ⋮ Unnamed Item

This page was built for publication: Low-Congestion Shortcuts without Embedding