The Exponential Time Complexity of Computing the Probability That a Graph is Connected

Details The Exponential Time Complexity of Computing the Probability That a Graph is Connected The Exponential Time Complexity of Computing the Probability That a Graph is Connected

2010-09-13

arxiv.org/abs/1009.2363v3

Computer Science

Computational Complexity

To appear in 5th International Symposium on Parameterized and Exact Computation (IPEC 2010), December 13-15, 2010, Chennai, In

Scientific paper

We show that for every probability p with 0 < p < 1, computation of
all-terminal graph reliability with edge failure probability p requires time
exponential in Omega(m/ log^2 m) for simple graphs of m edges under the
Exponential Time Hypothesis.

Affiliated with

Also associated with

No associations

Rating

The Exponential Time Complexity of Computing the Probability That a Graph is Connected does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Exponential Time Complexity of Computing the Probability That a Graph is Connected, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Exponential Time Complexity of Computing the Probability That a Graph is Connected will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-337558