Boolean sublattices connected with minimization problems on matroids

DOI10.1007/BF01581030zbMath0468.90079MaRDI QIDQ3922500

Masataka Nakamura

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

Boolean latticematroid intersectionnetwork decompositionaugmenting path algorithmBoolean sublatticesJordan- Hölder theoremmaximum- flow minimal cut equations

Mathematics Subject Classification ID

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

Related Items (4)

Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations ⋮ 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 ⋮ An extension of elementary bipartite graphs to matroid pairs and its characterization

Cites Work

• On the structure of all minimum cuts in a network and applications
• Matroid intersection algorithms
• AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
• ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
• Unnamed Item
• Unnamed Item
• Unnamed Item

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