Decomposition of submodular functions-Reference-Cited by-同舟云学术

Decomposition of submodular functions

Published:1983-03 Issue:1 Volume:3 Page:53-68
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Cunningham William H.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF02579341.pdf

Reference15 articles.

1. R. E. Bixby andW. H. Cunningham, Matroids, graphs, and 3-connectivity,in: Bondy and Murty (eds.)Graph Theory and Related Topics, Academic Press, New York (1979), 91–103.

2. R. E. Bixby, W. H. Cunningham andD. M. Topkis. The poset of a polymatroid vertex, extreme point,Report No. 82250—OR, Universität Bonn, 1982.

3. W. H. Cunningham, Decomposition of directed graphs,SIAM J. Algebraic and Discrete Methods 3 (1982), 214–228.

4. W. H. Cunningham, Testing membership in matroid polyhedra,Report No. 81207—OR, Universität Bonn, 1981, to appear inJ. Combinatorial Th. Ser B.

5. W. H. Cunningham andJ. Edmonds, A combinatorial decomposition theory,Canad. J. Math. 32 (1980), 734–765.

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hypergraph Unreliability in Quasi-Polynomial Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k;Mathematical Programming;2023-09-12

3. Generalized Submodular Information Measures: Theoretical Properties, Examples, Optimization Algorithms, and Applications;IEEE Transactions on Information Theory;2022-02

4. Nonsubmodular Optimization;Introduction to Combinatorial Optimization;2022

5. On Submodular Search and Machine Scheduling;Mathematics of Operations Research;2019-11