1. Bonsai: Efficient Fast Failover Routing Using Small Arborescences
2. Edge-disjoint branchings;edmonds;Combinatorial Algorithms,1973
3. Fast edge splitting and edmonds’ arborescence construction for unweighted graphs;bhalgat;ACM-SIAM SODA,2008
4. Improved fast rerouting using postprocessing;foerster;IEEE Transactions on Dependable and Secure Computing,2020