Matroid Steiner problems, the Tutte polynomial and network reliability

DOI10.1016/0095-8956(89)90062-2zbMath0618.05017OpenAlexW1994715527MaRDI QIDQ1088995

Charles J. Colbourn, William R. Pulleyblank

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90062-2

zbMATH Keywords

Tutte polynomialnetwork reliabilitymatroid Steiner problemSteiner complex

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Topological representations of matroids, Generalized activities and \(K\)-terminal reliability. II, Non-Stanley bounds for network reliability, Probabilistic single processor scheduling, Steiner systems and configurations of points, Combinatorial aspects of network reliability, Generalized activities and \(K\)-terminal reliability, Reliable assignments of processors to tasks and factoring on matroids, Network reliability: Numbers or insight? (A discussion paper)

Cites Work

• Unnamed Item
• Unnamed Item
• Homotopy properties of greedoids
• Chromatic polynomials and network reliability
• Hilbert functions of graded algebras
• The Tutte polynomial
• The Tutte Polynomial Part I: General Theory
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Disjoint Products and Efficient Computation of Reliability
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
• On the Tutte Polynomial of a Morphism of Matroids
• The Broken-Circuit Complex
• Matroids and a Reliability Analysis Problem
• Bounds on the Reliability Polynomial for Shellable Independence Systems
• A Contribution to the Theory of Chromatic Polynomials