Disjoint paths in a network
From MaRDI portal
Publication:4060767
DOI10.1002/NET.3230040204zbMATH Open0304.90114OpenAlexW2154434560WikidataQ56484790 ScholiaQ56484790MaRDI QIDQ4060767FDOQ4060767
Authors: J. W. Suurballe 
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) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35)
Cites Work
Cited In (53)
- Recovering a magnitude-symmetric matrix from its principal minors
- Factorization and exact evaluation of the source-terminal diameter-constrained reliability
- Computing disjoint paths with length constraints
- Heuristic search for one-to-many shortest path queries
- An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
- The complexity of finding two disjoint paths with min-max objective function
- Bounds for the symmetric 2-peripatetic salesman problem
- Fault-tolerant routing: \(k\)-inconnected many-to-one routing in wireless networks
- The undirected two disjoint shortest paths problem
- OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
- A theory of tie-set graph and its application to information network management
- Acyclic k-connected subgraphs for distributed alternate routing in communications networks
- Failure disjoint paths
- Finding disjoint paths in networks with star shared risk link groups
- Price-directive decomposition applied to routing in telecommunication networks
- Multicriteria movement synchronization scheduling problems and algorithms
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
- Optimal routing with failure-independent path protection
- Balanced paths in acyclic networks: Tractable cases and related approaches
- 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
- Routing of uncertain traffic demands
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
- The \(k\)-dissimilar vehicle routing problem
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
- Redundancy system design for an aircraft door management system
- Graphs and algorithms in communication networks on seven league boots
- Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths
- A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks
- On the complexity of the edge-disjoint min-min problem in planar digraphs
- Deviation algorithms for ranking shortest paths
- Complexity of a classical flow restoration problem
- Almost disjoint paths and separating by forbidden pairs
- On the complexity of resilient network design
- On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems
- Finding disjoint paths with related path costs
- Directed Steiner problems with connectivity constraints
- Finding the k Shortest Paths
- A shortest cycle for each vertex of a graph
- Identifying backbones in three-dimensional discrete fracture networks: a bipartite graph-based approach
- Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints
- A new \(O(m+k n \log \overline{d})\) algorithm to find the \(k\) shortest paths in acyclic digraphs
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
- Path Problems in Complex Networks
- Large fault-tolerant interconnection networks
- Analyse und Synthese zuverlässiger Netze
- Finding non-dominated bicriteria shortest pairs of disjoint simple paths
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
- Complexity of column generation in network design with path-based survivability mechanisms
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
- On finding Min-Min disjoint paths
This page was built for publication: Disjoint paths in a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060767)
