Splitting formulas for computing connectedness probability of undirected graphs

Splitting formulas for computing connectedness probability of undirected graphs

0.00 Avg rating—0 Votes
Article ID: iaor1990916
Country: Germany
Volume: 21
Start Page Number: 265
End Page Number: 270
Publication Date: Jun 1990
Journal: Optimization
Authors:
Abstract:

This paper presents a general splitting formula for computing the connectedness probability (overall reliability) of connected undirected graphs. To be precise, let G split into two subgraphs H and K which are edge disjoint and meet in n common vertices,

Reviews

Required fields are marked *. Your email address will not be published.