scientific article; zbMATH DE number 7375995
From MaRDI portal
Publication:5002746
DOI10.4230/LIPIcs.ICALP.2018.68zbMath1499.68406MaRDI QIDQ5002746
Publication date: 28 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40) Randomized algorithms (68W20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inapproximability of the Tutte polynomial
- On a problem of Spencer
- Monte-Carlo algorithms for the planar multiterminal network reliability problem
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Polynomial-Time Approximation Algorithms for the Ising Model
- A constructive proof of the general lovász local lemma
- Calculating bounds on reachability and connectedness in stochastic networks
- Computational Complexity of Network Reliability Analysis: An Overview
- The Complexity of Enumeration and Reliability Problems
- Complexity of network reliability computations
- Computing rooted communication reliability in an almost acyclic digraph
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
- The Computational Complexity of the Tutte Plane: the Bipartite Case
- On the computational complexity of the Jones and Tutte polynomials
- Uniform sampling through the Lovasz local lemma
- The Complexity of Computing the Sign of the Tutte Polynomial
- Improved bounds and algorithms for graph cuts and network reliability
- Generalized loop‐erased random walks and approximate reachability
- Moser and tardos meet Lovász
- Generating a random sink-free orientation in quadratic time
