暂无分享,去创建一个
[1] Guido Proietti,et al. Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem , 2007, Algorithmica.
[2] Guido Proietti,et al. Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree , 2010, MFCS.
[3] Stefano Leucci,et al. Fault-Tolerant Approximate Shortest-Path Trees , 2017, Algorithmica.
[4] Nicola Santoro,et al. Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree , 2004, IFIP TCS.
[5] Kun-Mao Chao,et al. The Swap Edges of a Multiple-Sources Routing Tree , 2007, Algorithmica.
[6] Yasuo Okabe,et al. Single backup table schemes for shortest-path routing , 2005, Theor. Comput. Sci..
[7] Stefano Leucci,et al. Compact and Fast Sensitivity Oracles for Single-Source Distances , 2016, ESA.
[8] Guido Proietti,et al. Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor , 2007, Theor. Comput. Sci..
[9] Enrico Nardelli,et al. A faster computation of the most vital edge of a shortest path , 2001, Inf. Process. Lett..
[10] Seth Pettie,et al. Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time , 2005, J. Graph Algorithms Appl..
[11] Seth Pettie. Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann Time , 2005, ISAAC.
[12] Enrico Nardelli,et al. Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast , 2002, Algorithmica.
[13] Nicola Santoro,et al. Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively , 2006, IEICE Trans. Inf. Syst..
[14] David Peleg,et al. Sparse Fault-Tolerant BFS Trees , 2013, ESA.
[15] Guido Proietti,et al. A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree , 2014, Algorithmica.
[16] Giuseppe F. Italiano,et al. Maintaining Spanning Trees of Small Diameter , 1994, ICALP.
[17] Michael Dinitz,et al. Fault-tolerant spanners: better and simpler , 2011, PODC '11.
[18] Nicola Santoro,et al. Computing all the best swap edges distributively , 2008, J. Parallel Distributed Comput..
[19] C. Jordan. Sur les assemblages de lignes. , 1869 .
[20] Fabrizio Grandoni,et al. Improved Purely Additive Fault-Tolerant Spanners , 2015, ESA.
[21] Ajoy Kumar Datta,et al. Linear Time Distributed Swap Edge Algorithms , 2013, CIAC.
[22] Stefano Leucci,et al. A Faster Computation of All the Best Swap Edges of a Tree Spanner , 2015, SIROCCO.
[23] Mikkel Thorup,et al. Oracles for Distances Avoiding a Failed Node or Link , 2008, SIAM J. Comput..
[24] Michael Langberg,et al. Fault Tolerant Spanners for General Graphs , 2010, SIAM J. Comput..
[25] Robert E. Tarjan,et al. Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees , 1982, Inf. Process. Lett..