The following pages link to Algorithms and Computation (Q5897938):
Displayed 24 items.
- Gromov hyperbolicity of planar graphs (Q386374) (← links)
- Hyperbolicity in the corona and join of graphs (Q499645) (← links)
- On the hyperbolicity constant in graphs (Q626757) (← links)
- Gromov hyperbolicity of periodic graphs (Q726503) (← links)
- Small values of the hyperbolicity constant in graphs (Q738866) (← links)
- Decomposing a graph into shortest paths with bounded eccentricity (Q777405) (← links)
- Obstructions to a small hyperbolicity in Helly graphs (Q1625787) (← links)
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications (Q1709598) (← links)
- Gromov hyperbolicity in lexicographic product graphs (Q1713070) (← links)
- On the hyperbolicity constant in graph minors (Q1734047) (← links)
- A review of two network curvature measures (Q1982207) (← links)
- Distance labeling schemes for \(K_4\)-free bridged graphs (Q2105446) (← links)
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures) (Q2182087) (← links)
- Distance and routing labeling schemes for cube-free median graphs (Q2223698) (← links)
- Hyperbolicity in median graphs (Q2253664) (← links)
- The hyperbolicity constant of infinite circulant graphs (Q2364774) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Computing the hyperbolicity constant (Q2429111) (← links)
- Characterization of Gromov hyperbolic short graphs (Q2440471) (← links)
- Gromov hyperbolicity of periodic planar graphs (Q2440494) (← links)
- Computing the hyperbolicity constant of a cubic graph (Q2931935) (← links)
- (Q5136231) (← links)
- Distributed Relationship Schemes for Trees (Q5387807) (← links)
- (Q5862676) (← links)