Generalized activities and reliability

The analysis of the Tutte polynomial of a matroid using activities is associated with a shelling of the family of spanning sets. We introduce an activities analysis of the reliability of a system specified by an arbitrary clutter, associated with an S-partition rather than a shelling. These activities are related to a method of constructing Boolean interval partitions developed by Dawson in the early 1980s.

[1]  J. E. Dawson A construction for a family of sets and its application to matroids , 1981 .

[2]  Jeremy E Dawson A collection of sets related to the tutte polynomial of a matroid , 1984 .

[3]  H. Crapo,et al.  The Tutte polynomial , 1969, 1707.03459.

[4]  J. Scott Provan,et al.  The Complexity of Reliability Computations in Planar and Acyclic Graphs , 1986, SIAM J. Comput..

[5]  Lorenzo Traldi Non-minimal sums of disjoint products , 2006, Reliab. Eng. Syst. Saf..

[6]  Lorenzo Traldi Generalized activities and K-terminal reliability. II , 1994, Discret. Math..

[7]  George L. Nemhauser,et al.  Matroids and a Reliability Analysis Problem , 1979, Math. Oper. Res..

[8]  Gary Gordon,et al.  Generalized activities and the tutte polynomial , 1990, Discret. Math..

[9]  J. Dawson A simple approach to some basic results in matroid theory , 1981 .

[10]  Jeremy E. Dawson,et al.  Matroid bases, opposite families and some related algorithms , 1982 .

[11]  Manoj K. Chari Steiner Complexes, Matroid Ports, and Shellability , 1993, J. Comb. Theory, Ser. B.

[12]  Michelle L. Wachs,et al.  Shellable nonpure complexes and posets. II , 1996 .

[13]  J. Scott Provan,et al.  Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra , 1980, Math. Oper. Res..

[14]  J. Scott Provan,et al.  Disjoint Products and Efficient Computation of Reliability , 1988, Oper. Res..

[15]  Frank Harary,et al.  Graph Theory , 2016 .

[16]  Lorenzo Traldi,et al.  Generalized activities and K-terminal reliability , 1990, Discret. Math..