Distributed Computing
From MaRDI portal
Publication:5395162
DOI10.1007/11561927zbMath1171.68360OpenAlexW4245215744MaRDI QIDQ5395162
Cyril Gavoille, Dahlia Malkhi, Ittai Abraham
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561927
Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items (8)
Collective tree spanners in graphs with bounded parameters ⋮ Strong-diameter decompositions of minor free graphs ⋮ Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications ⋮ Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs ⋮ Distance estimation and object location via rings of neighbors ⋮ \(k\)-chordal graphs: from cops and robber to compact routing via treewidth ⋮ Sparse covers for planar graphs and graphs that exclude a fixed minor ⋮ Local certification of graphs with bounded genus
This page was built for publication: Distributed Computing
