Pages that link to "Item:Q2327101"
From MaRDI portal
The following pages link to Fast approximation of centrality and distances in hyperbolic graphs (Q2327101):
Displaying 5 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)
- Vector centrality in hypergraphs (Q2677395) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix (Q5050372) (← links)