Near-optimal low-congestion shortcuts on bounded parameter graphs

DOI10.1007/978-3-662-53426-7_12zbMath1393.68021OpenAlexW2515165863MaRDI QIDQ1660932

Goran Zuzic, Bernhard Haeupler, Taisuke Izumi

Publication date: 16 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-53426-7_12

zbMATH Keywords

minimum cuttreewidthpathwidthminimum spanning treedistributed algorithmbounded-genus graphCONGEST model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

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: Near-optimal low-congestion shortcuts on bounded parameter graphs