The following pages link to Disjoint paths in a network (Q4060767):
Displaying 50 items.
- OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks (Q281809) (← links)
- The \(k\)-dissimilar vehicle routing problem (Q319301) (← links)
- Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths (Q328701) (← links)
- On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855) (← links)
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
- The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
- Fault-tolerant routing: \(k\)-inconnected many-to-one routing in wireless networks (Q621838) (← links)
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks (Q819071) (← links)
- Heuristic search for one-to-many shortest path queries (Q825009) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks (Q877588) (← links)
- 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)
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064) (← links)
- Finding non-dominated bicriteria shortest pairs of disjoint simple paths (Q1025230) (← links)
- Acyclic k-connected subgraphs for distributed alternate routing in communications networks (Q1115406) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- Price-directive decomposition applied to routing in telecommunication networks (Q1278255) (← links)
- Directed Steiner problems with connectivity constraints (Q1315992) (← links)
- Redundancy system design for an aircraft door management system (Q1652598) (← links)
- A shortest cycle for each vertex of a graph (Q1944201) (← links)
- The undirected two disjoint shortest paths problem (Q2294271) (← links)
- Finding disjoint paths in networks with star shared risk link groups (Q2344758) (← links)
- Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints (Q2354302) (← links)
- On finding Min-Min disjoint paths (Q2375950) (← links)
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks (Q2402675) (← links)
- A theory of tie-set graph and its application to information network management (Q2764564) (← links)
- Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
- Complexity of a classical flow restoration problem (Q2811305) (← links)
- (Q2861540) (← links)
- Complexity of column generation in network design with path-based survivability mechanisms (Q2892152) (← links)
- Path Problems in Complex Networks (Q2913787) (← links)
- Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs (Q3004683) (← links)
- A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
- On the complexity of resilient network design (Q3057137) (← links)
- Optimal routing with failure-independent path protection (Q3057139) (← links)
- Multicriteria movement synchronization scheduling problems and algorithms (Q3165912) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- Analyse und Synthese zuverlässiger Netze (Q4196224) (← links)
- Finding the k Shortest Paths (Q4210169) (← links)
- Bounds for the symmetric 2-peripatetic salesman problem (Q4327897) (← links)
- Identifying Backbones in Three-Dimensional Discrete Fracture Networks: A Bipartite Graph-Based Approach (Q4627440) (← links)
- Balanced paths in acyclic networks: Tractable cases and related approaches (Q4667719) (← links)
- A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs (Q5134451) (← links)
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS (Q5249002) (← links)
- A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks (Q5357510) (← links)
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
- On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems (Q6087136) (← links)
- Almost disjoint paths and separating by forbidden pairs (Q6199396) (← links)
