Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
From MaRDI portal
Publication:1100219
DOI10.1016/0166-218X(87)90008-4zbMath0639.05037MaRDI QIDQ1100219
Publication date: 1987
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Deterministic network models in operations research (90B10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15)
Related Items (max. 100)
On the irreducibility of layered mixed matrices ⋮ Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations ⋮ Theory of Principal Partitions Revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural theorems for submodular functions, polymatroids and polymatroid intersections
- Principal structures of submodular systems
- Network flow, transportation and scheduling. Theory and algorithms
- Coverings of Bipartite Graphs
- Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
- On the structure of all minimum cuts in a network and applications
- Use of matroid theory in operations research, circuits and systems theory
- Boolean sublattices connected with minimization problems on matroids
- Network Flow and Testing Graph Connectivity
- On an Approach to Techniques for the Analysis of the Structure of Large Systems of Equations
- Two Algorithms for Bipartite Graphs
This page was built for publication: Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
