The following pages link to (Q4855560):
Displaying 7 items.
- A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs (Q477692) (← links)
- Data communications, computer networks, and open systems. (Q1261059) (← links)
- Computing the \(K\)-terminal reliability of directed path graphs (Q2348708) (← links)
- (Q3361866) (← links)
- Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints (Q3418123) (← links)
- (Q3992866) (← links)
- (Q3997215) (← links)
