The following pages link to Low diameter graph decompositions (Q1316650):
Displayed 26 items.
- An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- Local and global price of anarchy of graphical games (Q631783) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- About randomised distributed graph colouring and graph partition algorithms (Q710742) (← links)
- Random martingales and localization of maximal inequalities (Q982510) (← links)
- Volume distortion for subsets of Euclidean spaces (Q1016538) (← links)
- Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs (Q1045170) (← links)
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms (Q1283779) (← links)
- Simple and efficient network decomposition and synchronization (Q1575640) (← links)
- Extending Lipschitz functions via random metric partitions (Q1770278) (← links)
- Absolute Lipschitz extendability (Q1876864) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- Fréchet embeddings of negative type metrics (Q2471721) (← links)
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q2575833) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Large Monochromatic Components in Two-colored Grids (Q3503446) (← links)
- Graph coloring with no large monochromatic components (Q3503460) (← links)
- Deciding Relaxed Two-Colourability: A Hardness Jump (Q3557504) (← links)
- Decompositions into Subgraphs of Small Diameter (Q4911111) (← links)
- Euclidean distortion and the sparsest cut (Q5423920) (← links)
- The Local and Global Price of Anarchy of Graphical Games (Q5459989) (← links)
- Colouring Planar Graphs With Three Colours and No Large Monochromatic Components (Q5495675) (← links)
- Cutting Corners Cheaply, or How to Remove Steiner Points (Q5502176) (← links)
- The intrinsic dimensionality of graphs (Q5900392) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)