scientific article; zbMATH DE number 432834
From MaRDI portal
Publication:3138968
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)
Recommendations
Cited in
(18)- Decomposing large graphs with small graphs of high density
- Covering Metric Spaces by Few Trees
- Faster distributed shortest path approximations via shortcuts
- A faster distributed protocol for constructing a minimum spanning tree
- Low-diameter graph decomposition is in NC
- scientific article; zbMATH DE number 4087704 (Why is no real title available?)
- 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
- CM fields of dihedral type and the Colmez conjecture
- Covering metric spaces by few trees
- Towards the Erdős-Gallai cycle decomposition conjecture
- Lipschitz extension theorems with explicit constants
- Steiner point removal with distortion \(O(\log k)\) using the \texttt{Relaxed-Voronoi} algorithm
- Decompositions into subgraphs of small diameter
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)
