论文信息 - An Algorithm for Submodular Functions on Graphs - 字舞流文

An Algorithm for Submodular Functions on Graphs

[1] E. L. Lawler,et al. Flow Network Formulations of Polymatroid Optimization Problems , 1982 .

[2] András Frank,et al. A Weighted Matroid Intersection Algorithm , 1981, J. Algorithms.

[3] András Frank,et al. How to make a digraph strongly connected , 1981, Comb..

[4] R. Burkard,et al. Minimal cost flows in regular matroids , 1981 .

[5] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[6] András Frank,et al. On the orientation of graphs , 1980, J. Comb. Theory, Ser. B.

[7] C. Lucchesi,et al. A Minimax Theorem for Directed Graphs , 1978 .

[8] László Lovász,et al. On two minimax theorems in graph , 1976, J. Comb. Theory, Ser. B.