Pages that link to "Item:Q959515"
From MaRDI portal
The following pages link to An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs (Q959515):
Displaying 10 items.
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511) (← links)
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks (Q877588) (← links)
- An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs (Q975758) (← links)
- A new algorithm for reoptimizing shortest paths when the arc costs change (Q1413907) (← links)
- Redundancy system design for an aircraft door management system (Q1652598) (← links)
- Super spanning connectivity on WK-recursive networks (Q1694677) (← links)
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (Q2146374) (← links)
- Sufficient conditions for graphs to be spanning connected (Q2177900) (← links)
- Finding disjoint paths with different path-costs: Complexity and algorithms (Q4022731) (← links)
- THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS (Q5401566) (← links)
