Pages that link to "Item:Q4968378"
From MaRDI portal
The following pages link to Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378):
Displaying 12 items.
- Eccentricity function in distance-hereditary graphs (Q784475) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
- Computing the eccentricity distribution of large graphs (Q1736547) (← links)
- Easy computation of eccentricity approximating trees (Q1741520) (← links)
- Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs (Q1799228) (← links)
- Fast approximation algorithms for \(p\)-centers in large \(\delta \)-hyperbolic graphs (Q1989499) (← links)
- Eccentricity terrain of \(\delta\)-hyperbolic graphs (Q2186812) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Helly-gap of a graph and vertex eccentricities (Q2663046) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities (Q6582369) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q6671670) (← links)
