Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2010.09.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2050719228
@@ Property / OpenAlex ID: W2050719228 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3236250
@@ Property / cites work: Q3236250 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Q5628150
@@ Property / cites work: Q5628150 / rank @@
+Normal rank
@@ Property / cites work @@
+Mengerian theorems for paths of bounded length
@@ Property / cites work: Mengerian theorems for paths of bounded length / rank @@
+Normal rank
@@ Property / cites work @@
+On line disjoint paths of bounded length
@@ Property / cites work: On line disjoint paths of bounded length / rank @@
+Normal rank
@@ Property / cites work @@
+Q3315542
@@ Property / cites work: Q3315542 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of finding maximum disjoint paths with length constraints
+Normal rank
@@ Property / cites work @@
+Length-Bounded Cuts and Flows
@@ Property / cites work: Length-Bounded Cuts and Flows / rank @@
+Normal rank
@@ Property / cites work @@
+Length-bounded cuts and flows
@@ Property / cites work: Length-bounded cuts and flows / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of vertex-disjoint length-restricted path problems
+Normal rank
@@ Property / cites work @@
+Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
+Normal rank
@@ Property / cites work @@
+Q4737515
@@ Property / cites work: Q4737515 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828931
@@ Property / cites work: Q4828931 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds for the unsplittable flow problem
@@ Property / cites work: Improved bounds for the unsplittable flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristics for finding a maximum number of disjoint bounded paths
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for edge-disjoint paths in planar graphs
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+On miniaturized problems in parameterized complexity theory
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of finding two disjoint paths with min-max objective function
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+A special planar satisfiability problem and a consequence of its NP- completeness
+Normal rank
@@ Property / cites work @@
+Capacitated Domination and Covering: A Parameterized Perspective
+Normal rank
@@ Property / cites work @@
+Planar Capacitated Dominating Set Is W[1]-Hard
@@ Property / cites work: Planar Capacitated Dominating Set Is W[1]-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417642
@@ Property / cites work: Q5417642 / rank @@
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
+Normal rank