A Fast Algorithm for Source-Wise Round-Trip Spanners
暂无分享,去创建一个
[1] Abu Reyan Ahmed,et al. Weighted Additive Spanners , 2020, WG.
[2] Ran Duan,et al. Roundtrip Spanners with $(2k-1)$ Stretch , 2020, ICALP.
[3] Lenore Cowen,et al. Compact roundtrip routing for digraphs , 1999, SODA '99.
[4] Telikepalli Kavitha,et al. New Pairwise Spanners , 2017, Theory of Computing Systems.
[5] Mikkel Thorup,et al. Approximate distance oracles , 2005, J. ACM.
[6] Christopher M. Hartman. Extremal problems in graph theory , 1997 .
[7] Shiri Chechik,et al. Constant girth approximation for directed graphs in subquadratic time , 2020, STOC.
[8] Mikkel Thorup,et al. Spanners and emulators with sublinear distance errors , 2006, SODA '06.
[9] Amir Abboud,et al. The 4/3 additive spanner exponent is tight , 2015, J. ACM.
[10] Gregory Bodwin,et al. Linear Size Distance Preservers , 2016, SODA.
[11] Telikepalli Kavitha,et al. Small Stretch Pairwise Spanners , 2013, ICALP.
[12] Shiri Chechik,et al. New Additive Spanners , 2013, SODA.
[13] Kurt Mehlhorn,et al. Additive spanners and (α, β)-spanners , 2010, TALG.
[14] Piotr Indyk,et al. Fast estimation of diameter and shortest paths (without matrix multiplication) , 1996, SODA '96.
[15] Kam-yiu Lam,et al. Source-wise round-trip spanners , 2017, Inf. Process. Lett..
[16] David P. Dobkin,et al. On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..
[17] David Peleg,et al. (1+epsilon, beta)-Spanner Constructions for General Graphs , 2004, SIAM J. Comput..
[18] Jose Augusto Ramos Soares,et al. Graph Spanners: a Survey , 1992 .
[19] Stephen Alstrup,et al. Constructing Light Spanners Deterministically in Near-Linear Time , 2017, ESA.
[20] Jakub W. Pachocki,et al. Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners , 2016, SODA.
[21] Edith Cohen,et al. Size-Estimation Framework with Applications to Transitive Closure and Reachability , 1997, J. Comput. Syst. Sci..
[22] Stephen G. Kobourov,et al. Graph Spanners: A Tutorial Review , 2020, Comput. Sci. Rev..
[23] Michael Elkin,et al. Sparse Sourcewise and Pairwise Distance Preservers , 2006, SIAM J. Discret. Math..
[24] Mikkel Thorup,et al. Roundtrip spanners and roundtrip routing in directed graphs , 2002, SODA '02.
[25] Gary L. Miller,et al. Parallel graph decompositions using random shifts , 2013, SPAA.
[26] Alejandro A. Schäffer,et al. Graph spanners , 1989, J. Graph Theory.
[27] David P. Woodruff. Additive Spanners in Nearly Quadratic Time , 2010, ICALP.
[28] Mikkel Thorup,et al. Deterministic Constructions of Approximate Distance Oracles and Spanners , 2005, ICALP.
[29] Fabrizio Grandoni,et al. On Pairwise Spanners , 2013, STACS.
[30] Jakub W. Pachocki,et al. Routing under balance , 2016, STOC.
[31] Michael Dinitz,et al. Optimal Vertex Fault-Tolerant Spanners in Polynomial Time , 2020, SODA.
[32] Seth Pettie,et al. Low distortion spanners , 2007, TALG.
[33] Virginia Vassilevska Williams,et al. Conditionally optimal approximation algorithms for the girth of a directed graph , 2020, ICALP.
[34] Merav Parter,et al. Bypassing Erdős' Girth Conjecture: Hybrid Stretch and Sourcewise Spanners , 2014, ICALP.
[35] Béla Bollobás,et al. Extremal problems in graph theory , 1977, J. Graph Theory.
[36] Kam-yiu Lam,et al. Deterministic improved round-trip spanners , 2018, Inf. Process. Lett..