Pages that link to "Item:Q2327101"

The following pages link to Fast approximation of centrality and distances in hyperbolic graphs (Q2327101):

Displaying 3 items.

• Easy computation of eccentricity approximating trees (Q1741520) (← links)
• An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time (Q2011037) (← links)
• Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)