scientific article
From MaRDI portal
Publication:3138968
zbMath0785.05073MaRDI QIDQ3138968
Nathan Linial, Michael E. Saks
Publication date: 20 October 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items (11)
Low-diameter graph decomposition is in NC ⋮ The geometry of graphs and some of its algorithmic applications ⋮ A faster distributed protocol for constructing a minimum spanning tree ⋮ Covering metric spaces by few trees ⋮ Advances in metric embedding theory ⋮ Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles ⋮ Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm ⋮ Unnamed Item ⋮ Covering Metric Spaces by Few Trees ⋮ On the bandwidth of triangulated triangles ⋮ Graph theoretical issues in computer networks
This page was built for publication:
