Fast approximation of centrality and distances in hyperbolic graphs
From MaRDI portal
Publication:2327101
DOI10.1007/978-3-030-04651-4_1OpenAlexW2804916770MaRDI QIDQ2327101
Victor Chepoi, Feodor F. Dragan, Yann Vaxès, H. Alrasheed, Michel A. Habib
Publication date: 11 October 2019
Full work available at URL: https://arxiv.org/abs/1805.07232
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
Easy computation of eccentricity approximating trees ⋮ An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs
This page was built for publication: Fast approximation of centrality and distances in hyperbolic graphs
