Matroid theory and its applications in electric network theory and in statics
From MaRDI portal
Publication:1210828
zbMath0723.05023MaRDI QIDQ1210828
Publication date: 5 June 1993
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Combinatorial aspects of matroids and geometric lattices (05B35) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Applications of graph theory to circuits and networks (94C15) Statics (70C20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items
A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits ⋮ Structure and stability of the equilibrium set in potential-driven flow networks ⋮ The complexity of finding arc-disjoint branching flows ⋮ Matroid union -- graphic? binary? neither? ⋮ König's theorem and bimatroids ⋮ A theorem on the principal structure for independent matchings ⋮ Source location with rigidity and tree packing requirements ⋮ A dual approximation approach to weighted matroid intersection ⋮ Bracing cubic grids - a necessary condition ⋮ Efficient optimal equation formulation in lumped power-conserving systems ⋮ On the graphic matroid parity problem ⋮ Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability ⋮ Arc-disjoint spanning sub(di)graphs in digraphs ⋮ The graphicity of the union of graphic matroids ⋮ Bond graphs. I: Acausal equivalence ⋮ Change of order for regular chains in positive dimension ⋮ Applications of combinatorics to statics --- a second survey ⋮ Sublattices of product spaces: Hulls, representations and counting ⋮ Graded sparse graphs and body-length-direction frameworks ⋮ Persistency in combinatorial optimization problems on matroids ⋮ Tensegrity frameworks in one-dimensional space ⋮ Rigidity, global rigidity, and graph decomposition ⋮ Polynomials with the half-plane property and the support theorems ⋮ Bipartition constrained edge-splitting in directed graphs ⋮ Boundary value problems on weighted networks ⋮ A parameterized view on matroid optimization problems ⋮ The \(d\)-dimensional rigidity matroid of sparse graphs
