Finding Minimum Congestion Spanning Trees (2000)
Renato F. Werneck, João C. Setubal, Jo~ao C. Setubal
this paper we study a combinatorial congestion problem. We de ne a congestion problem as an allocation problem where each \resource" may be shared by any number of \users", but where any...
Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin, Jo~ao C. Setubal, Jorge Stolfi
This TR is a revision of the TR #97-127. The original TR was based on implementations written in different languages, different style, and using somewhat different low-level data structures. After...
Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin, J.C. Setubal, Jo~ao C. Setubal, Jorge Stolfi
We conduct a computational study of unit capacity flow and bipartite matching algorithms. Our goal is to determine which variant of the push-relabel method is most efficient in practice and to...
Sequential and Parallel Experimental Results with Bipartite Matching Algorithms (1996)
J. Setubal, Jo~ao C. Setubal, Jo~ao C. Setubal
We present experimental results for four bipartite matching algorithms on 11 classes of graphs. The algorithms are depth-first search (dfs), breadth-first search (bfs), the push-relabel algorithm...
New Experimental results for Bipartite Matching (1992)
J. Setubal, Novembro De, Jo~ao C. Setubal, Jo~ao C. Setubal
We present experimental results for 3 bipartite matching algorithms on three classes of sparse graphs. Goldberg's maximum flow algorithm [Gol87, GT88b], specialized for unweighted bipartite...