scientific article; zbMATH DE number 3600054
From MaRDI portal
Publication:4166767
Cited in
(21)- Some combinatorial properties of discriminants in metric vector spaces
- Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
- Combinatorial dynamical system theory: General framework and controllability criteria
- König's theorem and bimatroids
- Eigensets and power products of a bimatroid
- On structures of bisubmodular polyhedra
- The Tutte polynomial of a ported matroid
- Some recent results in combinatorial approaches to dynamical systems
- Combinatorial analysis. (Matrix problems, choice theory)
- Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form
- A note on polylinking flow networks
- A Matroid Abstraction of the Bott–Duffin Constrained Inverse
- Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
- Boolean sublattices connected with minimization problems on matroids
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Integral decomposition in polyhedra
- Poset matching---a distributive analog of independent matching
- A flow model based on polylinking system
- Structural theorems for submodular functions, polymatroids and polymatroid intersections
- Optimal matchings in posets
- Induction of M-convex functions by linking systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4166767)