scientific article; zbMATH DE number 432834
From MaRDI portal
Publication:3138968
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Recommendations
Cited in
(19)- Low diameter graph decompositions
- Graph theoretical issues in computer networks
- CM fields of dihedral type and the Colmez conjecture
- On the bandwidth of triangulated triangles
- The geometry of graphs and some of its algorithmic applications
- Covering metric spaces by few trees
- Distributed strong diameter network decomposition
- Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
- scientific article; zbMATH DE number 4087704 (Why is no real title available?)
- Decomposing large graphs with small graphs of high density
- Steiner point removal with distortion \(O(\log k)\) using the \texttt{Relaxed-Voronoi} algorithm
- Decompositions into subgraphs of small diameter
- Low-diameter graph decomposition is in NC
- Faster distributed shortest path approximations via shortcuts
- Covering Metric Spaces by Few Trees
- Advances in metric embedding theory
- Towards the Erdős-Gallai cycle decomposition conjecture
- Lipschitz extension theorems with explicit constants
- A faster distributed protocol for constructing a minimum spanning tree
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)
