暂无分享,去创建一个
[1] Piotr Indyk,et al. Fast estimation of diameter and shortest paths (without matrix multiplication) , 1996, SODA '96.
[2] Lenore Cowen,et al. Compact roundtrip routing for digraphs , 1999, SODA '99.
[3] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[4] Mikkel Thorup,et al. Roundtrip spanners and roundtrip routing in directed graphs , 2002, SODA '02.
[5] David P. Dobkin,et al. On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..
[6] Lenore Cowen,et al. Compact roundtrip routing in directed networks , 2004, J. Algorithms.
[7] Christopher M. Hartman. Extremal problems in graph theory , 1997 .
[8] Jakub W. Pachocki,et al. Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners , 2016, SODA.
[9] Michael Dinitz,et al. Directed spanners via flow-based linear programs , 2011, STOC '11.
[10] Sofya Raskhodnikova. Transitive-Closure Spanners: A Survey , 2010, Property Testing.
[11] Shiri Chechik,et al. Constant girth approximation for directed graphs in subquadratic time , 2020, STOC.
[12] Uri Zwick,et al. All-Pairs Almost Shortest Paths , 1997, SIAM J. Comput..
[13] Kam-yiu Lam,et al. Deterministic improved round-trip spanners , 2018, Inf. Process. Lett..
[14] Piotr Berman,et al. Finding Sparser Directed Spanners , 2010, FSTTCS.
[15] Uri Zwick,et al. Exact and Approximate Distances in Graphs - A Survey , 2001, ESA.
[16] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[17] Béla Bollobás,et al. Extremal problems in graph theory , 1977, J. Graph Theory.
[18] Arnab Bhattacharyya,et al. Improved Approximation for the Directed Spanner Problem , 2011, ICALP.
[19] Mikkel Thorup,et al. Approximate distance oracles , 2001, JACM.