An improved cut-based recursive decomposition algorithm for reliability analysis of networks

2012 ◽  
Vol 11 (1) ◽  
pp. 1-10 ◽  
Author(s):  
Wei Liu ◽  
Jie Li
2019 ◽  
Vol 29 (07) ◽  
pp. 1165-1191
Author(s):  
Courtney R. Gibbons ◽  
Robert Huben ◽  
Branden Stone

In the spirit of Boij–Söderberg theory, we introduce a recursive decomposition algorithm for the Betti diagram of a complete intersection using the diagram of a complete intersection defined by a subset of the original generators. This alternative algorithm is the main tool that we use to investigate stability and compatibility of the Boij–Söderberg decompositions of related diagrams; indeed, when the biggest generating degree is sufficiently large, the alternative algorithm produces the Boij–Söderberg decomposition. We also provide a detailed analysis of the Boij–Söderberg decomposition for Betti diagrams of codimension four complete intersections where the largest generating degree satisfies the size condition.


2013 ◽  
Vol 5 ◽  
pp. 177-182
Author(s):  
Hui Li ◽  
Yiwen Wang ◽  
Ping Li ◽  
Yunyi Li

Sign in / Sign up

Export Citation Format

Share Document