No article text was recorded for this version.
probabilistic network reliability complexity
Version 2 of 232 papers46 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On Uncertain Graphs Modeling and Queries
- Blog: Hypergraph Unreliability in Quasi-Polynomial Time
- Blog: Improved bounds and algorithms for graph cuts and network reliability
- Blog: Efficient Network Reliability Computation in Uncertain Graphs
- Blog: Distance-Constraint Reachability Computation in Uncertain Graphs
- Blog: Approximating Queries on Probabilistic Graphs
- Blog: Distributed Storage Allocations
- Blog: LINC: A Motif Counting Algorithm for Uncertain Graphs
- Blog: Beyond the Quadratic Time Barrier for Network Unreliability
- Blog: Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults
- Blog: On a Class of Stochastic Multilayer Networks
- Blog: Network Unreliability in Almost-Linear Time
- Blog: A Fast and Accurate ASP Counting Based Network Reliability Estimator
- Blog: XOR-Sampling for Network Design with Correlated Stochastic Events
- Blog: Counting-Based Reliability Estimation for Power-Transmission Grids
- Blog: On the Uplink SINR Meta Distribution of UAV-assisted Wireless Networks
- Blog: Efficient and robust allocation algorithms in clouds under memory constraints
- Blog: Uncertain Graph Sparsification
- Blog: Exact calculations of first-passage properties on the pseudofractal scale-free web
- Blog: Approximate Algorithms for Stochastic Network Design
- Blog: Efficient Computation of Probabilistic Core Decomposition at Web-Scale
- Blog: An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs
- Blog: Fast Reliability Search in Uncertain Graphs
- Blog: Improved bounds and algorithms for graph cuts and network reliability
- Blog: Uncertain Graphs meet Collaborative Filtering
- Blog: Balanced families of perfect hash functions and their applications
- Blog: Network Reliability Estimation in Theory and Practice
- Blog: Multi-stage graph peeling algorithm for probabilistic core decomposition
- Blog: Butterfly counting and bitruss decomposition on uncertain bipartite graphs
- Blog: Most Probable Densest Subgraphs
- Blog: Principled network reliability approximation: A counting-based approach
- Blog: Mutants and Residents with Different Connection Graphs in the Moran Process
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_probabilistic_network_reliability_comple_752c7827,
title = {probabilistic network reliability complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/probabilistic-network-reliability-complexity/rdr_752c7827a24e48bcb5266d02fcede477},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 2, frozen text):
@misc{lacuna_probabilistic_network_reliability_comple_752c7827_v2,
title = {probabilistic network reliability complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/probabilistic-network-reliability-complexity/rdr_752c7827a24e48bcb5266d02fcede477/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-21},
}