Edge-packings of graphs and network reliability

DOI10.1016/0012-365X(88)90193-8zbMATH Open0657.90041MaRDI QIDQ1111461FDOQ1111461

Charles J. Colbourn

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• scientific article
• 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

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)

Cites Work

• Title not available (Why is that?)
• 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
• The Complexity of Enumeration and Reliability Problems
• The NP-Completeness of Edge-Coloring
• Minimum partition of a matroid into independent subsets
• Blocking and anti-blocking pairs of polyhedra
• Calculating bounds on reachability and connectedness in stochastic networks
• NP completeness of finding the chromatic index of regular graphs
• Lower bounds on two-terminal network reliability
• Title not available (Why is that?)
• Complexity of network reliability computations
• Title not available (Why is that?)
• Bounds on the Reliability Polynomial for Shellable Independence Systems
• Improving reliability bounds in computer networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Network reliability analysis: Part I

Cited In (14)

• Sixty years of network reliability
• Edge-Disjoint Packing of Stars and Cycles
• Fast computation of bounds for two-terminal network reliability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A polynomial-time simplex method for the maximum \(k\)-flow problem
• A note on bounding \(k\)-terminal reliability
• On the \(k\)-cut subgraph polytope
• Title not available (Why is that?)
• Practical sequential bounds for approximating two-terminal reliability
• Packing \([1, \Delta ]\)-factors in graphs of small degree
• Reliable assignments of processors to tasks and factoring on matroids
• A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs

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)