The strongly connected reliability of complete digraphs

DOI10.1002/NET.20060MaRDI QIDQ4680417zbMATH OpenOpenAlexFDO

Authors Jason I. Brown, Xiaohu Li

Publication date 1 June 2005

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20060

zbMATH Keywords

algorithmreachability

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On the roots of strongly connected reliability polynomials
• Uniformly optimal digraphs for strongly connected reliability
• Computing rooted communication reliability in an almost acyclic digraph
• Network reliability analysis using 2-connected digraph reductions
• Exact computation of strongly connected reliability by binary decision diagrams

Cited in

(10)

• The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane
• Exact computation of strongly connected reliability by binary decision diagrams
• On the roots of strongly connected reliability polynomials
• Uniformly optimal digraphs for strongly connected reliability
• scientific article; zbMATH DE number 3912072 (Why is no real title available?)
• Network reliability analysis using 2-connected digraph reductions
• An open research problem: strong completeness of R Kowalski's connection graph proof procedure
• A recursive formula for the two‐edge connected and biconnected reliability of a complete graph
• Network reliability: Heading out on the highway
• Existence of optimally‐greatest digraphs for strongly connected node reliability

This page was built for publication: The strongly connected reliability of complete digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680417)