Canonical decompositions of symmetric submodular systems
From MaRDI portal
Publication:760444
DOI10.1016/0166-218X(83)90040-9zbMath0555.05046MaRDI QIDQ760444
Publication date: 1983
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items
A note on minimizing submodular functions, Minimum Cuts and Sparsification in Hypergraphs, Directed submodularity, ditroids and directed submodular flows, Maximizing set function formulation of two scheduling problems, A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint, Decomposition of k-ary relations, Minimizing symmetric submodular functions, Recent trends in combinatorial optimization, A decomposition of distributive lattices
Cites Work
- Principal structures of submodular systems
- A structural characterization of planar combinatorial graphs
- Multi-Terminal Network Flows
- A Combinatorial Decomposition Theory
- The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
- Polymatroidal dependence structure of a set of random variables
- Dividing a Graph into Triconnected Components
- Connectivity in Matroids
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
