Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
From MaRDI portal
Cited in
(49)- Disjoint paths in symmetric digraphs
- Structure and recognition of graphs with no 6-wheel subdivision
- Disjoint directed and undirected paths and cycles in digraphs
- Embedding ternary trees in VLSI arrays
- The directed subgraph homeomorphism problem
- The subgraph homeomorphism problem
- The point-to-point delivery and connection problems: Complexity and algorithms
- A linear algorithm for the all-bidirectional-edges problem on planar graphs
- Strictly-upward drawings of ordered search trees
- Advances in the theory and practice of graph drawing
- On the Euclidean two paths problem
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- Linear area upward drawings of AVL trees
- The disjoint shortest paths problem
- Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values
- Length-bounded disjoint paths in planar graphs
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs
- Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph
- Displaying trees across two phylogenetic networks
- On finding Min-Min disjoint paths
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
- Simple undirected two-commodity integral flow with a unitary demand
- (Arc-)disjoint flows in networks
- Hypernetworks in a directed hypergraph
- Rectilinear paths among rectilinear obstacles
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
- Arc-disjoint paths in decomposable digraphs
- An efficient algorithm for k-pairwise disjoint paths in star graphs
- Acyclic digraphs
- Multicriteria movement synchronization scheduling problems and algorithms
- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs
- Improved Algorithms for the 2-Vertex Disjoint Paths Problem
- Rooted K₄-minors
- Bonds with parity constraints
- On making directed graphs transitive
- Finding the k Shortest Paths
- Balanced paths in acyclic networks: Tractable cases and related approaches
- Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results
- The Directed Disjoint Shortest Paths Problem
- The complexity of finding two disjoint paths with min-max objective function
- Computing the rooted triplet distance between phylogenetic networks
- Walking through waypoints
- A Trichotomy for Regular Trail Queries
- Snapshot disjointness in temporal graphs
- Fixed node determination and analysis in directed acyclic graphs of structured networks
- Optimal parallel algorithms for path problems on planar graphs
- An exponential time parameterized algorithm for planar disjoint paths
- Bounds on path connectivity
- A simple solution to the two paths problem in planar graphs
This page was built for publication: Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140364)
