On the complexity of secluded path problems
From MaRDI portal
Cites work
- A note on two problems in connexion with graphs
- Algorithmic meta-theorems for restrictions of treewidth
- An application of simultaneous diophantine approximation in combinatorial optimization
- Approximating clique-width and branch-width
- Approximating rank-width and clique-width quickly
- Finding \(k\)-secluded trees faster
- Finding a minimum spanning tree with a small non-terminal set
- Finding Branch-Decompositions and Rank-Decompositions
- Finding connected secluded subgraphs
- Finding the k Shortest Paths
- scientific article; zbMATH DE number 6515825 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Intractability of clique-width parameterizations
- Minkowski's Convex Body Theorem and Integer Programming
- Modular decomposition and transitive orientation
- On a routing problem
- On the computational complexity of length- and neighborhood-constrained path problems
- On the computational difficulty of the terminal connection problem
- On the parameterized complexity of multiple-interval graph problems
- Parameterized algorithms
- Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
- Parameterized complexity of secluded connectivity problems
- Secluded connectivity problems
- Shortest paths algorithms: Theory and experimental evaluation
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
- Upper bounds to the clique width of graphs
This page was built for publication: On the complexity of secluded path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356319)
