Pages that link to "Item:Q877588"
From MaRDI portal
The following pages link to Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks (Q877588):
Displaying 8 items.
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs (Q959515) (← links)
- An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs (Q975758) (← links)
- Enumerating \(K\) best paths in length order in DAGs (Q1926859) (← links)
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (Q2146374) (← links)
- Analysis of shortest paths and subscriber line lengths in telecommunication access networks (Q2379703) (← links)
- Mathematical programming algorithms for two-path routing problems with reliability considerations (Q2901035) (← links)
- Information security: Designing a stochastic-network for throughput and reliability (Q5305565) (← links)
- An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks (Q6138511) (← links)
