scientific article; zbMATH DE number 1295362
From MaRDI portal
Publication:4248175
zbMath0924.05065MaRDI QIDQ4248175
Manoj K. Chari, Charles J. Colbourn
Publication date: 3 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Practical sequential bounds for approximating two-terminal reliability ⋮ Information security: Designing a stochastic-network for throughput and reliability ⋮ \(g\)-elements of matroid complexes. ⋮ A practical bounding algorithm for computing two-terminal reliability based on decomposition technique ⋮ On the structure of the \(h\)-vector of a paving matroid ⋮ Speeding up computation of the reliability polynomial coefficients for a random graph ⋮ The zero forcing polynomial of a graph ⋮ A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges ⋮ Unnamed Item ⋮ The chip-firing game
This page was built for publication:
