Image de couverture de livre

Computing Time-varying Network Reliability using Binary Decision Diagrams

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Nakahata, Yu, Arizono, Shun, Kasahara, Shoji
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Reconfiguring Multiple Connected Components with Size Multiset Constraints
par: Nakahata, Yu
Publié: (2025)

A Tensor Network based Decision Diagram for Representation of Quantum Circuits
par: Hong, Xin, et autres
Publié: (2020)

Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams
par: Tani, Seiichiro
Publié: (2019)

LimTDD: A Compact Decision Diagram Integrating Tensor and Local Invertible Map Representations
par: Hong, Xin, et autres
Publié: (2025)

Implicit Decision Diagrams
par: Rudich, Isaac, et autres
Publié: (2026)

FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams
par: Wang, Ziyuan, et autres
Publié: (2025)

Breaking the Treewidth Barrier in Quantum Circuit Simulation with Decision Diagrams
par: Cheng, Bin, et autres
Publié: (2025)

Witty: An Efficient Solver for Computing Minimum-Size Decision Trees
par: Staus, Luca Pascal, et autres
Publié: (2024)

Advancing Quantum State Preparation Using Decision Diagram with Local Invertible Maps
par: Hong, Xin, et autres
Publié: (2025)

Nearly Optimal Bounds for Computing Decision Tree Splits in Data Streams
par: Ta, Hoang, et autres
Publié: (2026)

Computing String Covers in Sublinear Time
par: Radoszewski, Jakub, et autres
Publié: (2024)

Property Testing of Computational Networks
par: Czumaj, Artur, et autres
Publié: (2025)

Quantum Circuit Simulation with Fast Tensor Decision Diagram
par: Zhang, Qirui, et autres
Publié: (2024)

Distributed computation of temporal twins in periodic undirected time-varying graphs
par: Azerouk, Lina, et autres
Publié: (2024)

Interval Selection with Binary Predictions
par: Karavasilis, Christodoulos
Publié: (2025)

A Lock-free Binary Trie
par: Ko, Jeremy
Publié: (2024)

Designing Approximate Binary Trees for Trees
par: Kellerhals, Leon, et autres
Publié: (2026)

Network Unreliability in Almost-Linear Time
par: Cen, Ruoxu, et autres
Publié: (2025)

Hardness Amplification for Dynamic Binary Search Trees
par: Jiang, Shunhua, et autres
Publié: (2024)

Noisy (Binary) Searching: Simple, Fast and Correct
par: Dereniowski, Dariusz, et autres
Publié: (2021)

Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices
par: Ghosal, Angikar, et autres
Publié: (2025)

Binary $k$-Center with Missing Entries: Structure Leads to Tractability
par: Soheil, Farehe, et autres
Publié: (2025)

Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs
par: Li, Shi
Publié: (2024)

Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
par: Georgiadis, Loukas, et autres
Publié: (2026)

A Polynomial Decision for 3-SAT
par: Weiss, Angela
Publié: (2022)

Arithmetical Binary Decision Tree Traversals
par: Zhang, Jinxiong
Publié: (2022)

Global Predecessor Indexing: Avoiding Binary Search in Weighted Job Scheduling
par: Joshi, Amit
Publié: (2025)

Online Sampling and Decision Making with Low Entropy
par: Hajiaghayi, Mohammad Taghi, et autres
Publié: (2021)

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
par: Ihalainen, Hannes, et autres
Publié: (2025)

Diagram Control and Model Order for Sugiyama Layouts
par: Domrös, Sören, et autres
Publié: (2024)

Online Decision Making with Fairness over Time
par: Chen, Rui, et autres
Publié: (2022)

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
par: Mieno, Takuya, et autres
Publié: (2024)

A Generalized Binary Tree Mechanism for Differentially Private Approximation of All-Pair Distances
par: Dinitz, Michael, et autres
Publié: (2025)

Binary weights spanning trees and the $k$-red spanning tree problem in linear time
par: Hochbaum, Dorit S.
Publié: (2024)

A Note on Second-Order Expected Maximum-Load Bounds for Binary Linear Hashing
par: Bshouty, Nader H.
Publié: (2026)

Effective Index Construction Algorithm for Optimal $(k,η)$-cores Computation
par: Sun, Shengli, et autres
Publié: (2025)

A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
par: Dempsey, Jordan, et autres
Publié: (2024)

Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries
par: Shah, Vihan
Publié: (2026)

Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries
par: Chen, Xi, et autres
Publié: (2024)

HART: A Hybrid Addressing Scheme for Self-Balancing Binary Search Trees in Phase Change Memory (PCM)
par: Desai, Mahek, et autres
Publié: (2025)