An Algorithm for Minimum Cost Arc-Connectivity Orientations
暂无分享,去创建一个
[1] C. Nash-Williams. On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs , 1960, Canadian Journal of Mathematics.
[2] A. Frank. An Algorithm for Submodular Functions on Graphs , 1982 .
[3] A. Nijenhuis. Combinatorial algorithms , 1975 .
[4] András Frank,et al. How to make a digraph strongly connected , 1981, Comb..
[5] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .
[6] Harold N. Gabow. A matroid approach to finding edge connectivity and packing arborescences , 1991, STOC '91.
[7] Adrian Vetta,et al. Visualizing, Finding and Packing Dijoins , 2005 .
[8] Harold N. Gabow. Centroids, Representations, and Submodular Flows , 1995, J. Algorithms.
[9] C. Lucchesi,et al. A Minimax Theorem for Directed Graphs , 1978 .
[10] D. R. Fulkerson,et al. On edge-disjoint branchings , 1976, Networks.
[11] D. Avis,et al. Graph theory and combinatorial optimization , 2005 .
[12] László Lovász,et al. On two minimax theorems in graph , 1976, J. Comb. Theory, Ser. B.
[13] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[14] Harold N. Gabow. A framework for cost-scaling algorithms for submodular flow problems , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.