Pages that link to "Item:Q3898311"
From MaRDI portal
The following pages link to Use of matroid theory in operations research, circuits and systems theory (Q3898311):
Displayed 9 items.
- Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations (Q1100219) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- New algorithms for the intersection problem of submodular systems (Q1202762) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- A theorem on the principal structure for independent matchings (Q1897351) (← links)
- Decomposition of a bidirected graph into strongly connected components and its signed poset structure (Q1923614) (← links)
- Generalized lexicographically optimal flows in networks with multiple sources and sinks (Q3668257) (← links)
- Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems— (Q3731772) (← links)
- Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations (Q3761563) (← links)