Edge-packing of graphs and network reliability
- 1 December 1988
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 72 (1-3) , 49-61
- https://doi.org/10.1016/0012-365x(88)90193-8
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Bounding all-terminal reliability in computer networksNetworks, 1988
- Improving reliability bounds in computer networksNetworks, 1986
- Calculating bounds on reachability and connectedness in stochastic networksNetworks, 1983
- NP completeness of finding the chromatic index of regular graphsJournal of Algorithms, 1983
- Bounds on the Reliability Polynomial for Shellable Independence SystemsSIAM Journal on Algebraic Discrete Methods, 1982
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- Complexity of network reliability computationsNetworks, 1980
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961
- Zur allgemeinen KurventheorieFundamenta Mathematicae, 1927