The following pages link to Low diameter graph decompositions (Q1316650):
Displaying 45 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)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Extending Lipschitz functions via random metric partitions (Q1770278) (← links)
- Absolute Lipschitz extendability (Q1876864) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- Set cover problems with small neighborhood covers (Q2322696) (← links)
- Fréchet embeddings of negative type metrics (Q2471721) (← links)
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q2575833) (← links)
- Distributed strong diameter network decomposition (Q2672581) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- Distributed Distance-Bounded Network Design Through Distributed Convex Programming (Q3300803) (← 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)
- Graph Clustering using Effective Resistance (Q4993308) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- (Q5009588) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs (Q5232322) (← 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)
- (Q5875457) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
- The intrinsic dimensionality of graphs (Q5900392) (← links)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)
