Boolean sublattices connected with minimization problems on matroids

DOI10.1007/BF01581030MaRDI QIDQ3922500zbMATH OpenFDO

Authors Masataka Nakamura

Publication date 1982

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

augmenting path algorithmBoolean latticeBoolean sublatticesJordan- Hölder theoremmatroid intersectionmaximum- flow minimal cut equationsnetwork decomposition

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cites work

• ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
• AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
• scientific article; zbMATH DE number 3750964 (Why is no real title available?)
• scientific article; zbMATH DE number 3600054 (Why is no real title available?)
• scientific article; zbMATH DE number 3245483 (Why is no real title available?)
• Matroid intersection algorithms
• On the structure of all minimum cuts in a network and applications

Cited in

(4)

• Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
• An extension of elementary bipartite graphs to matroid pairs and its characterization
• Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations
• Structural theorems for submodular functions, polymatroids and polymatroid intersections

This page was built for publication: Boolean sublattices connected with minimization problems on matroids

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