Cover Image

An FPRAS for two terminal reliability in directed acyclic graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Feng, Weiming, Guo, Heng
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

#CFG and #DNNF admit FPRAS
by: Meel, Kuldeep S., et al.
Published: (2024)

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence
by: Meel, Kuldeep S., et al.
Published: (2025)

An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
by: Meel, Kuldeep S., et al.
Published: (2024)

Approximate Counting for Spin Systems in Sub-Quadratic Time
by: Anand, Konrad, et al.
Published: (2023)

Making an oriented graph acyclic using inversions of bounded or prescribed size
by: Bang-Jensen, Jørgen, et al.
Published: (2025)

Rapid mixing in positively weighted restricted Boltzmann machines
by: Feng, Weiming, et al.
Published: (2026)

Approximately Counting Knapsack Solutions in Subquadratic Time
by: Feng, Weiming, et al.
Published: (2024)

A faster FPRAS for #NFA
by: Meel, Kuldeep S., et al.
Published: (2023)

Deterministic counting from coupling independence
by: Chen, Xiaoyu, et al.
Published: (2024)

On approximating the $f$-divergence between two Ising models
by: Feng, Weiming, et al.
Published: (2025)

Rapid Mixing via Coupling Independence for Spin Systems with Unbounded Degree
by: Chen, Xiaoyu, et al.
Published: (2024)

Data reduction for directed feedback vertex set on graphs without long induced cycles
by: Dirks, Jona, et al.
Published: (2023)

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
by: Jaberi, Raed, et al.
Published: (2024)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
by: Kasperski, Adam, et al.
Published: (2024)

Quantum property testing in sparse directed graphs
by: Apers, Simon, et al.
Published: (2024)

Translating between the representations of an acyclic convex geometry of bounded degree
by: Defrain, Oscar, et al.
Published: (2025)

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
by: Feng, Weiming, et al.
Published: (2022)

Simulating Gaussian boson sampling on graphs in polynomial time
by: Anand, Konrad, et al.
Published: (2025)

An efficient recursive decomposition algorithm for undirected graphs
by: Heng, Pei, et al.
Published: (2026)

Symmetry-breaking symmetry in directed spectral partitioning
by: Pasadakis, Dimosthenis, et al.
Published: (2025)

Finding coherent node groups in directed graphs
by: Kumpulainen, Iiro, et al.
Published: (2023)

Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
by: Hatzel, Meike, et al.
Published: (2022)

Learning CNF formulas from uniform random solutions in the local lemma regime
by: Feng, Weiming, et al.
Published: (2025)

A characterization of one-sided error testable graph properties in bounded degeneracy graphs
by: Lachish, Oded, et al.
Published: (2026)

Differentially private graph coloring
by: Xie, Michael, et al.
Published: (2026)

The trace reconstruction problem for spider graphs
by: Sun, Alec, et al.
Published: (2022)

The Canadian Traveller Problem on outerplanar graphs
by: Beaudou, Laurent, et al.
Published: (2024)

Private graph colouring with limited defectiveness
by: Christiansen, Aleksander B. G., et al.
Published: (2024)

Practical algorithms for Hierarchical overlap graphs
by: Talera, Saumya, et al.
Published: (2024)

Approximating the Total Variation Distance between Gaussians
by: Bhattacharyya, Arnab, et al.
Published: (2025)

Approximating the total variation distance between spin systems
by: Feng, Weiming, et al.
Published: (2025)

Spanning tree congestion of proper interval graphs
by: Otachi, Yota
Published: (2026)

Approximating optimization problems in graphs with locational uncertainty
by: Bougeret, Marin, et al.
Published: (2022)

Improved girth approximation in weighted undirected graphs
by: Kadria, Avi, et al.
Published: (2025)

Fair densest subgraph across multiple graphs
by: Arachchi, Chamalee Wickrama, et al.
Published: (2025)

On $k$-connectivity oracles in $k$-connected graphs
by: Nutov, Zeev
Published: (2026)

Upper bounds on the theta function of random graphs
by: Feige, Uriel, et al.
Published: (2025)

On recognizing graphs representing Persistent Perfect Phylogenies
by: Bonizzoni, Paola, et al.
Published: (2025)

Strassen's algorithm via orbit flip graphs
by: Ikenmeyer, Christian, et al.
Published: (2025)

The Leafed Induced Subtree in chordal and bounded treewidth graphs
by: Baste, Julien
Published: (2023)