Disjoint paths in a network
From MaRDI portal
Publication:4060767
DOI10.1002/net.3230040204zbMath0304.90114OpenAlexW2154434560WikidataQ56484790 ScholiaQ56484790MaRDI QIDQ4060767
Publication date: 1974
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230040204
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)
Related Items
A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks, Heuristic search for one-to-many shortest path queries, OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks, Complexity of column generation in network design with path-based survivability mechanisms, Multicriteria movement synchronization scheduling problems and algorithms, Routing of uncertain traffic demands, On finding Min-Min disjoint paths, The \(k\)-dissimilar vehicle routing problem, Path Problems in Complex Networks, Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths, Finding disjoint paths with related path costs, Redundancy system design for an aircraft door management system, Acyclic k-connected subgraphs for distributed alternate routing in communications networks, On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks, Large fault-tolerant interconnection networks, Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks, A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem, On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems, Fault-tolerant routing: \(k\)-inconnected many-to-one routing in wireless networks, A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks, Bounds for the symmetric 2-peripatetic salesman problem, A shortest cycle for each vertex of a graph, Almost disjoint paths and separating by forbidden pairs, On the complexity of the edge-disjoint min-min problem in planar digraphs, Identifying Backbones in Three-Dimensional Discrete Fracture Networks: A Bipartite Graph-Based Approach, Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs, A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row, Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks, An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs, A theory of tie-set graph and its application to information network management, Balanced paths in acyclic networks: Tractable cases and related approaches, An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs, Unnamed Item, On the complexity of resilient network design, Optimal routing with failure-independent path protection, The complexity of finding two disjoint paths with min-max objective function, A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs, Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure, The undirected two disjoint shortest paths problem, Complexity of a classical flow restoration problem, Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem, Finding non-dominated bicriteria shortest pairs of disjoint simple paths, Analyse und Synthese zuverlässiger Netze, Price-directive decomposition applied to routing in telecommunication networks, Graphs and Algorithms in Communication Networks on Seven League Boots, Finding the k Shortest Paths, DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS, Finding disjoint paths in networks with star shared risk link groups, Directed Steiner problems with connectivity constraints, Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints
Cites Work
