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

DOI10.1007/978-3-642-17493-3_19zbMath1253.68176arXiv1009.2363MaRDI QIDQ3058703

Thore Husfeldt, Nina Taslaman

Publication date: 7 December 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.2363

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C40: Connectivity

Uses Software

• tutte_bhkk