Finding multiple induced disjoint paths in general graphs
From MaRDI portal
Recommendations
- Graph-Theoretic Concepts in Computer Science
- Finding disjoint paths in split graphs
- Finding disjoint paths in split graphs
- The Induced Disjoint Paths Problem
- scientific article; zbMATH DE number 4089593
- Induced disjoint paths problem in a planar digraph
- Decomposing graphs into internally-disjoint induced paths
- Finding k Disjoint Paths in a Directed Planar Graph
Cites work
- Approximating disjoint-path problems using greedy algorithms and packing integer programs
- Edge-disjoint paths in planar graphs with constant congestion
- scientific article; zbMATH DE number 5899246 (Why is no real title available?)
- Induced disjoint paths problem in a planar digraph
- Multipath routing in ad hoc wireless networks with omni directional and directional antenna: A comparative study
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- On the disjoint paths problem
- The Induced Disjoint Paths Problem
Cited in
(3)
This page was built for publication: Finding multiple induced disjoint paths in general graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944193)