Complexity of some graph-based bounds on the probability of a union of events
type: Item
instance of: scholarly article
title: Complexity of some graph-based bounds on the probability of a union of events
zbMATH Open document ID: 1387.05048
author: Andrea Scozzari
author: Fabio Tardella
published in: Discrete Applied Mathematics
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 6872588
zbMATH Keywords: Bonferroni bounds
zbMATH Keywords: 2-trees
zbMATH Keywords: chordal graphs
zbMATH Keywords: cherry trees
zbMATH Keywords: coherent probability
MaRDI profile type: Publication
full work available at URL: j.dam.2018.03.012
OpenAlex ID: W2794875535
cites work: Polynomially Computable Bounds for the Probability of the Union of Events
cites work: Graph Classes: A Survey
cites work: Upper bounds for the probability of a union by multitrees
cites work: Computing bounds for the probability of the union of events by different methods
cites work: Probability bounds with cherry trees.
cites work: Probability bounds given by hypercherry trees
cites work: On spanning 2-trees in a graph
cites work: On the SPANNING \(k\)-TREE problem
cites work: NC algorithms for recognizing chordal graphs and k trees
cites work: The complexity of regular subgraph recognition
cites work: Q5794394
cites work: Theory of Probability
cites work: Bonferroni-Type Inequalities via Chordal Graphs
cites work: Improved Bonferroni inequalities via abstract tubes. Inequalities and identities of inclusion-exclusion type
cites work: Lower bounds for the probability of a union via chordal graphs
cites work: Q4198056
cites work: Sharpened Bonferroni inequalities
cites work: Best Possible Inequalities for the Probability of a Logical Function of Events
cites work: On acyclic simplicial complexes
cites work: An upper bound for the probability of a union
cites work: Iterative Methods in Combinatorial Optimization
cites work: Degree constrained node-connectivity problems
cites work: On simple characterizations of k-trees
cites work: Computational algebraic algorithms for the reliability of generalized \(k\)-out-of-\(n\) and related systems
cites work: On the complexity of some subgraph problems
cites work: Hypertrees and Bonferroni inequalities
cites work: Minimum spanning hypertrees
cites work: Upper bounds of degree 3 for the probability of the union of events via linear programming
cites work: New upper bounds on the probability of events based on graph structures
cites work: An improved Bonferroni inequality and applications
DOI: 10.1016/J.DAM.2018.03.012
description: scientific article; zbMATH DE number 6872588