Pages that link to "Item:Q2664113"
From MaRDI portal
The following pages link to Fast approximation and exact computation of negative curvature parameters of graphs (Q2664113):
Displaying 9 items.
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications (Q1709598) (← links)
- Fellow travelers phenomenon present in real-world networks (Q2086588) (← links)
- Computing the Gromov hyperbolicity of a discrete metric space (Q2345853) (← links)
- Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
- On computing the Gromov hyperbolicity (Q2828207) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs (Q5115790) (← links)
- When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)
- On computing discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions (Q6076351) (← links)