Use of matroid theory in operations research, circuits and systems theory
From MaRDI portal
Publication:3898311
DOI10.1080/00207728108963728zbMath0451.90053OpenAlexW2001930104MaRDI QIDQ3898311
Publication date: 1981
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207728108963728
applicationsindependent setspolymatroidsmatroid theoryminimum-weight maximum-cardinality intersection
Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
A theorem on the principal structure for independent matchings, Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations, Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids, Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—, Efficient computation of implicit representations of sparse graphs, Decomposition of a bidirected graph into strongly connected components and its signed poset structure, Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach, Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations, Forests, frames, and games: Algorithms for matroid sums and applications, New algorithms for the intersection problem of submodular systems, Applications of matroids in electric network theory, Generalized lexicographically optimal flows in networks with multiple sources and sinks
Cites Work
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- The principal minors of a matroid
- Matroids, generalized networks, and electric network synthesis
- Coverings of Bipartite Graphs
- A note on finding optimum branchings
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)
- Rado's theorem for polymatroids
- A survey of multi-way channels in information theory: 1961-1976
- Finding optimum branchings
- The capacity region of general multiple-access channel with certain correlated sources
- Investigating solvability and complexity of linear active networks by means of matroids
- Recent results in the Shannon theory
- On the Abstract Properties of Linear Dependence
- An Introduction to Matroid Theory
- Transversals and matroid partition
- Optimum branchings
- Noiseless coding of correlated information sources
