Oriented matroid systems
From MaRDI portal
Publication:617896
DOI10.1016/j.dam.2010.09.008zbMath1203.05027OpenAlexW2074108040MaRDI QIDQ617896
Publication date: 14 January 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.09.008
Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Cancellation in cyclic consecutive systems
- On the characterization of the domination of a diameter-constrained network reliability model
- A Survey of Network Reliability and Domination Theory
- Computational Complexity of Coherent Systems and the Reliability Polynomial
- Domination theory and the crapo β-invariant
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
- (K, j)-domination and (K, j)-reliability
- Oriented Matroids
- Network reliability and the factoring theorem
- Computing k-out-of-n System Reliability
This page was built for publication: Oriented matroid systems