scientific article; zbMATH DE number 432834
From MaRDI portal
Publication:3138968
zbMATH Open0785.05073MaRDI QIDQ3138968FDOQ3138968
Authors: Nathan Linial, Michael Saks 
Publication date: 20 October 1993
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15)
Cited In (16)
- Decomposing large graphs with small graphs of high density
- Covering Metric Spaces by Few Trees
- Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm
- A faster distributed protocol for constructing a minimum spanning tree
- Low-diameter graph decomposition is in NC
- Title not available (Why is that?)
- On the bandwidth of triangulated triangles
- The geometry of graphs and some of its algorithmic applications
- Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
- Advances in metric embedding theory
- Low diameter graph decompositions
- Graph theoretical issues in computer networks
- Covering metric spaces by few trees
- Lipschitz extension theorems with explicit constants
- Towards the Erdős-Gallai cycle decomposition conjecture
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138968)
