Algorithms for graphic polymatroids and parametric s̄-sets

Journal of Algorithms

Volumn 26, Issue 1, 1998, Pages 48-86

  Gabow, Harold N ^a  

^a UCB 450   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001931206     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0904     Document Type: Article

References (39)

1. R. K. Ahuja, J. B. Orlin, C. Stein, and R. E. Tarjan, Improved algorithms for bipartite network flow, SIAM J. Comput. 23(5) (1994), 906-933.
2. F. Barahona, Separating from the dominant of the spanning tree polytope, Oper. Res. Lett. 12 (1992), 201-203.
3. S. Baum and L. E. Trotter, Jr., Integer rounding for polymatroid and branching optimization problems, SIAM J. Alg. Disc. Meth. 2(4) (1981), 416-425.
4. W. H. Cunningham, Optimal attack and reinforcement of a network, J. Assoc. Comput. Mach. 32(3) (1985), 549-561.
5. W. H. Cunningham, Minimum cuts, modular functions and matroid polyhedra, Networks 15 (1985), 205-215.
6. E. Cheng and W. H. Cunningham, A faster algorithm for computing the strength of a network, Inform. Process. Lett. 49 (1994), 209-212.
7. W. Dinkelbach, On nonlinear fractional programming, Management Sci. 13 (1967), 492-498.
8. J. Edmonds, Lehman's switching game and a theorem of Tutte and Nash-Williams, J. Res. National Bureau of Standards 69B (1965), 73-77.
9. J. Edmonds, Submodular functions, matroids, and certain polyhedra, in Calgary International Conf. on Combinatorial Structures and their Applications," pp. 69-87, Gordon and Breach, New York, 1969.
10. J. Edmonds, Edge-disjoint branchings, in "Combinatorial Algorithms" (R. Rustin, Ed.), pp. 91-96, Algorithmics Press, New York, 1972.
11. A. Frank, Kernel systems of directed graphs, Acta Sci. Math. 41 (1979), 63-76.
12. A. Frank, Covering branchings, Acta Sci. Math. 41 (1979), 77-81.
13. A. Frank and A. Gyárfás, How to orient the edges of a graph?, in "Combinatorics, I" (A. Hajnal and V. T. Sós, Eds.), Colloq. Math. Soc. János Bolyai, Vol. 18, pp. 353-364, North-Holland, Amsterdam, 1978.
14. H. N. Gabow, Applications of a poset representation to edge connectivity and graph igidity, in "Proc. 32nd Annual Symp. on Found, of Comp. Sci., 1991," pp. 812-821. Also Technical Report CU-CS-545-91, Dept. of Computer Science, University of Colorado at Boulder, 1991.)
15. H. N. Gabow, Efficient splitting off algorithms for graphs, in "Proc. 26th Annual ACM Symp. on Theory of Comp., 1994," pp. 696-705.
16. H. N. Gabow, A matroid approach to finding edge connectivity and packing arborescences, J. Comput. System Sci. 50(2) (1995), 259-273.
17. H. N. Gabow, Algorithms for graphic polymatroids and parametric s-sets, in "Proc. 6th Annual ACM-SIAM Symp. on Disc. Algorithms, 1995," pp. 88-97.
18. F. R. Giles, "Submodular Functions, Graphs and Integer Polyhedra," Ph.D. dissertation, Dept. of Combinatorics and Optimization, University of Waterloo, Ontario, 1975.
19. D. Gusfield, Connectivity and edge-disjoint spanning trees, Inform. Process. Lett. 16(2) (1983), 87-89.
20. D. Gusfield, Computing the strength of a graph, SIAM J. Comput. 20(4) (1991), 639-654.
21. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan, A fast parametric maximum flow algorithm and applications, SIAM J. Comput. 18(1) (1989), 30-55.
22. H. N. Gabow and K. S. Manu, Packing algorithms for arborescences (and spanning trees) in capacitated graphs, in "Proc. Fourth MPS Conf. on Integer Programming and Combinatorial Optimization, 1995," pp. 388-402. (Also Math. Programming B, to appear.)
23. H. N. Gabow and K. S. Manu, Packing algorithms for arborescences (and spanning trees) in capacitated graphs, in "Proc. Fourth MPS Conf. on Integer Programming and Combinatorial Optimization, 1995," pp. 388-402. (Also Math. Programming B, to appear.)
24. A. V. Goldberg and R. E. Tarjan, A new approach to the maximum-flow problem, J. Assoc. Comput. Mach. 35(4) (1988), 921-940.
25. H. N. Gabow and H. H. Westermann, Forests, frames and games: Algorithms for matroid sums and applications, Algorithmica 7 (1992), 465-497.
26. F. Harary, "Graph Theory," Addison-Wesley, Reading, MA, 1969.
27. J. Hao and J. B. Orlin, A faster algorithm for finding the minimum cut in a directed graph, J. Algorithms 17(3) (1994), 424-446.
28. V. King, S. Rao, and R. Tarjan, A faster deterministic maximum flow algorithm, J. Algorithms 17(3) (1994), 447-474.
29. L. R. Matthews, Bicircular matroids, Quart. J. Math. Oxford 28(2) (1977), 213-228.
30. C. St. J. A. Nash-Williams, Decomposition of finite graphs into forests, J. London Math. Soc. 39 (1964), 12.
31. J.-C. Picard and M. Queyranne, A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory, Networks 12 (1982), 141-159.
32. J.-C. Picard and M. Queyranne, Selected applicatons of minimum cuts in networks, INFOR 20 (1982), 394-422.
33. M. W. Padberg and L. A. Wolsey, Trees and cuts, Ann. Discrete Math. 17 (1983), 511-517.
34. M. W. Padberg and L. A. Wolsey, Fractional covers for forests and matchings, Math. Programming 29 (1984), 1-14.
35. S. Phillips and J. Westbrook, Online load balancing and network flow, in "Proc. 25th Annual ACM Symp. on Theory of Comp., 1993," pp. 402-411.
36. S. Schaible, Fractional programming II. On Dinkelbach's algorithm, Management Sci. 22 (1976), 868-873.
37. D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees, J. Comput. System Sci. 26 (1983), 362-391.
38. R. E. Tarjan, "Data Structures and Network Algorithms," SIAM, Philadelphia, PA, 1983.
39. D. J. A. Welsh, "Matroid Theory," Academic Press, New York, 1976.