A Faster Computation of All the Best Swap Edges of a Tree Spanner
暂无分享,去创建一个
[1] David Peleg,et al. Approximating Minimum Max-Stretch spanning Trees on unweighted graphs , 2004, SODA '04.
[2] Kun-Mao Chao,et al. The Swap Edges of a Multiple-Sources Routing Tree , 2007, Algorithmica.
[3] Feodor F. Dragan,et al. Distance Approximating Trees for Chordal and Dually Chordal Graphs , 1999, J. Algorithms.
[4] Ittai Abraham,et al. Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion , 2007, SODA '07.
[5] Seth Pettie. Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann Time , 2005, ISAAC.
[6] Leizhen Cai,et al. Tree Spanners , 1995, SIAM J. Discret. Math..
[7] Giuseppe F. Italiano,et al. Maintaining Spanning Trees of Small Diameter , 1998, Algorithmica.
[8] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[9] Mikkel Thorup,et al. Maintaining information in fully dynamic trees with top trees , 2003, TALG.
[10] Guido Proietti,et al. Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor , 2007, Theor. Comput. Sci..
[11] Guido Proietti,et al. A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree , 2014, Algorithmica.
[12] Christian Liebchen,et al. The zoo of tree spanner problems , 2008, Discret. Appl. Math..
[13] Guido Proietti,et al. Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree , 2012, Algorithmica.