Technical Report CS0341

Title: An Inprovement of an Algorithm for Construction of Edge Disjoint Branchings
Authors: S. Moran
Abstract: Let G=(V,E) be a directed graph such that for some r in V, and for every u in V-{r}, there are k edge disjoint, directed paths from r to u. We present an O(k|V||E|+k^3|V|^2) algorithm to construct k edge disjoint branchings rooted at r. This algbrithm is a modification of an O(|k|^2|V||E|) algorithm of Shiloach for the same task which is based on Lovasz proqf of a Theotem of Edmonds, that implies the existence of such edge disjoint branchings.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1984
To the main CS technical reports page

Computer science department, Technion