Edge-packings of graphs and network reliability
From MaRDI portal
Publication:1111461
DOI10.1016/0012-365X(88)90193-8zbMath0657.90041MaRDI QIDQ1111461
Publication date: 1988
Published in: Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Sixty years of network reliability, On the \(k\)-cut subgraph polytope, Fast computation of bounds for two-terminal network reliability, Practical sequential bounds for approximating two-terminal reliability, Edge-Disjoint Packing of Stars and Cycles, Packing \([1, \Delta \)-factors in graphs of small degree], A note on bounding \(k\)-terminal reliability, Reliable assignments of processors to tasks and factoring on matroids, A polynomial-time simplex method for the maximum \(k\)-flow problem, A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
Cites Work
- Lower bounds on two-terminal network reliability
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Calculating bounds on reachability and connectedness in stochastic networks
- Improving reliability bounds in computer networks
- The Complexity of Enumeration and Reliability Problems
- Complexity of network reliability computations
- The NP-Completeness of Edge-Coloring
- Bounds on the Reliability Polynomial for Shellable Independence Systems
- NP completeness of finding the chromatic index of regular graphs
- Minimum partition of a matroid into independent subsets
- Network reliability analysis: Part I
- Blocking and anti-blocking pairs of polyhedra
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
