A Faster Algorithm for Finding Edge-Disjoint Branchings

@article{Tong1983AFA,
  title={A Faster Algorithm for Finding Edge-Disjoint Branchings},
  author={Po Tong and Eugene L. Lawler},
  journal={Inf. Process. Lett.},
  year={1983},
  volume={17},
  pages={73-76}
}
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

A unification of network coding and tree-packing (routing) theorems

IEEE Transactions on Information Theory • 2006
View 3 Excerpts
Method Support
Highly Influenced

Datacast: A Scalable and Efficient Reliable Group Data Delivery Service for Data Centers

IEEE Journal on Selected Areas in Communications • 2012
View 2 Excerpts
Method Support

Path Splicing with Guaranteed Fault Tolerance

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference • 2009
View 1 Excerpt

Randomized Decentralized Broadcasting Algorithms

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications • 2007

Reduced-complexity network coding for multicasting over ad hoc networks

Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005. • 2005
View 1 Excerpt