一种新的启发式边排序策略及其性能分析

网络可靠度BDD分析方法的计算复杂度与BDD尺度线性相关，而BDD尺度严重依赖边排序质量。由于求解最优边排序是一个NP问题，在实际应用中，通常采用启发式边排序策略如BFS（Breadth First Search）和DFS（Depth First Search）。针对边排序问题，从分析基于边界集（Boundary Set）的BDD构建方法BDD BS出发，将边界集思想应用于边排序过程，提出了一种新的启发式边排序策略。性能分析和大量实验表明，新设计的边排序策略性能优于经典的DFS和BFS策略，该结果为网络可靠度BDD分析方法在大规模网络中的应用拓展了新的空间。

A novel heuristic edge ordering strategy and its performance analysis

The computational complexity of the BDD (Binary Decision Diagram) based network reliability method is linear correlated to the size of BDD that heavily depends on the quality of edge ordering.Because it is still NP-hard to find the optimum edge ordering, heuristic ordering methods such as BFS (Breadth First Search) or DFS (Depth First Search) are commonly used in practice.For the edge ordering strategy, boundary set is first used to analyze the characteristics of constructing BDD,and then a high performance edge ordering strategy based on the boundary set is proposed.Several experiments show that the new strategy outperforms the classic methods such as DFS and BFS.The results extend new space for network reliability analysis method using BDD in large scale networks.