Expected value expansions in rooted graphs
From MaRDI portal
Publication:1811135
DOI10.1016/S0166-218X(02)00568-1zbMath1023.05127MaRDI QIDQ1811135
Gary Gordon, Alison Bailey, Matthew Patton, Jennifer Scancella
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
90B25: Reliability, availability, maintenance, inspection in operations research
90C27: Combinatorial optimization
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Expected rank in antimatroids, Expected rank and randomness in rooted graphs, Distinguished vertices in probabilistic rooted graphs
Cites Work
- Interval partitions and activities for the greedoid Tutte polynomial
- Greedoids
- Cohesion and stability in graphs
- Lower bounds on two-terminal network reliability
- Generalized activities and the Tutte polynomial
- The optimal unicyclic graphs for pair-connected reliability
- Series and parallel reductions for the Tutte polynomial
- Best second order bounds for two-terminal network reliability with dependent edge failures
- Tough graphs and Hamiltonian circuits.
- When bad things happen to good trees
- Uniformly-most reliable networks do not always exist
- Calculating bounds on reachability and connectedness in stochastic networks
- A survey of gossiping and broadcasting in communication networks
- Network Resilience
- Graphs as models of communication network vulnerability: Connectivity and persistence
- Introduction to Greedoids
- Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs
- Expected Value Expansions in Random Subgraphs with Applications to Network Reliability
- Network reliability and the factoring theorem
- Renormalization of two—terminal reliability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
