Structural theorems for submodular functions, polymatroids and polymatroid intersections

DOI10.1007/BF01864166zbMATH Open0723.05027OpenAlexW2037239668MaRDI QIDQ757383FDOQ757383

Authors: Masataka Nakamura 

Publication date: 1988

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01864166

Recommendations

• scientific article; zbMATH DE number 1953186
• scientific article; zbMATH DE number 3898611
• A Structure Theory for the Parametric Submodular Intersection Problem
• scientific article
• Structures of polyhedra determined by submodular functions on crossing families
• Structures of subpartitions related to a submodular function minimization
• Generalized polymatroids and submodular flows
• Submodular functions and independence structures
• Optimization over the polyhedron determined by a submodular function on a co-intersecting family
• scientific article; zbMATH DE number 1379520

zbMATH Keywords

submodular functions

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Title not available (Why is that?)
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Title not available (Why is that?)
• Transversals and matroid partition
• Title not available (Why is that?)
• Decomposition of Finite Graphs Into Forests
• Title not available (Why is that?)
• A Solution of the Shannon Switching Game
• Minimum partition of a matroid into independent subsets
• Title not available (Why is that?)
• Coverings of Bipartite Graphs
• ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
• Matroid intersection algorithms
• On the structure of all minimum cuts in a network and applications
• On the Inversion of Sparse Matrices
• Title not available (Why is that?)
• Optimal flows in networks with multiple sources and sinks
• AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two Algorithms for Bipartite Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bimatroids and invariants
• The principal minors of a matroid
• ON THE REPRESENTATION OF THE RIGID SUB-SYSTEMS OF A PLANE LINK SYSTEM
• Boolean sublattices connected with minimization problems on matroids
• Title not available (Why is that?)
• A NOTE ON THE DECOMPOSITION OF POLY-LINKING SYSTEMS AND THE MINORS OF GENERALIZED POLYMATROIDS

Cited In (11)

• Hierarchical decomposition of symmetric discrete systems by matroid and group theories
• Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
• A Structure Theory for the Parametric Submodular Intersection Problem
• A NOTE ON THE DECOMPOSITION OF POLY-LINKING SYSTEMS AND THE MINORS OF GENERALIZED POLYMATROIDS
• Parametric bisubmodular function minimization and its associated signed ring family
• Canonical decompositions of symmetric submodular systems
• An extension of elementary bipartite graphs to matroid pairs and its characterization
• Theory of principal partitions revisited
• Title not available (Why is that?)
• Structures of polyhedra determined by submodular functions on crossing families
• Title not available (Why is that?)

This page was built for publication: Structural theorems for submodular functions, polymatroids and polymatroid intersections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757383)