Edge-packings of graphs and network reliability

DOI10.1016/0012-365X(88)90193-8MaRDI QIDQ1111461zbMATHFDO

Authors Charles J. Colbourn

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

spanning treesreliability boundsedge-packinggraph-theoretical techniquesreliability of a network

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 4045783
• scientific article; zbMATH DE number 205333
• Bounding network-reliability using consecutive minimal cutsets
• scientific article; zbMATH DE number 975420
• Series-Parallel Bounds for the Two-Terminal Reliability Problem

Cites work

• scientific article; zbMATH DE number 4045783 (Why is no real title available?)
• scientific article; zbMATH DE number 3506434 (Why is no real title available?)
• scientific article; zbMATH DE number 3523603 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3290885 (Why is no real title available?)
• Blocking and anti-blocking pairs of polyhedra
• Bounds on the Reliability Polynomial for Shellable Independence Systems
• Calculating bounds on reachability and connectedness in stochastic networks
• Complexity of network reliability computations
• Edge-Disjoint Spanning Trees of Finite Graphs
• Improving reliability bounds in computer networks
• Lower bounds on two-terminal network reliability
• Minimum partition of a matroid into independent subsets
• NP completeness of finding the chromatic index of regular graphs
• Network reliability analysis: Part I
• On the Problem of Decomposing a Graph into n Connected Factors
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Complexity of Enumeration and Reliability Problems
• The NP-Completeness of Edge-Coloring

Cited in

(14)

• A branch-price-and-cut algorithm for packing cuts in undirected graphs
• Reliable assignments of processors to tasks and factoring on matroids
• scientific article; zbMATH DE number 975420 (Why is no real title available?)
• Edge-disjoint packing of stars and cycles
• scientific article; zbMATH DE number 4045783 (Why is no real title available?)
• Packing \([1, \Delta ]\)-factors in graphs of small degree
• scientific article; zbMATH DE number 205333 (Why is no real title available?)
• Sixty years of network reliability
• A polynomial-time simplex method for the maximum \(k\)-flow problem
• Practical sequential bounds for approximating two-terminal reliability
• A note on bounding \(k\)-terminal reliability
• scientific article; zbMATH DE number 5176323 (Why is no real title available?)
• Fast computation of bounds for two-terminal network reliability
• On the \(k\)-cut subgraph polytope

This page was built for publication: Edge-packings of graphs and network reliability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111461)