Disjoint paths in sparse graphs (Q967419): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2009.03.009
@@ Property / DOI: 10.1016/j.dam.2009.03.009 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2009.03.009
+Normal rank
@@ Property / OpenAlex ID @@
+W1971175938
@@ Property / OpenAlex ID: W1971175938 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
+Normal rank
@@ Property / cites work @@
+On the complexity of the multicut problem in bounded tree-width graphs and digraphs
+Normal rank
@@ Property / cites work @@
+Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of embedding planar graphs to minimize certain distance measures
+Normal rank
@@ Property / cites work @@
+Q4734761
@@ Property / cites work: Q4734761 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471352
@@ Property / cites work: Q4471352 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002769
@@ Property / cites work: Q3002769 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint paths in Planar graphs with constant congestion
+Normal rank
@@ Property / cites work @@
+Multicommodity flow, well-linked terminals, and routing problems
+Normal rank
@@ Property / cites work @@
+A note on multiflows and treewidth
@@ Property / cites work: A note on multiflows and treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4779157
@@ Property / cites work: Q4779157 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Q3972951
@@ Property / cites work: Q3972951 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint paths in planar graphs
@@ Property / cites work: Edge-disjoint paths in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Paths in Expander Graphs
@@ Property / cites work: Edge-Disjoint Paths in Expander Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+The planar multiterminal cut problem
@@ Property / cites work: The planar multiterminal cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231910
@@ Property / cites work: Q4231910 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations for the disjoint paths problem in high-diameter planar networks
+Normal rank
@@ Property / cites work @@
+Q3840354
@@ Property / cites work: Q3840354 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the greedy algorithm for the unsplittable flow problem
+Normal rank
@@ Property / cites work @@
+Q4828931
@@ Property / cites work: Q4828931 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for maximum integral two-commodity flow in planar graphs
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Eulerian disjoint paths problem in grid graphs is NP-complete
+Normal rank
@@ Property / cites work @@
+On the complexity of the disjoint paths problem
@@ Property / cites work: On the complexity of the disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+The edge-disjoint paths problem is NP-complete for series-parallel graphs
+Normal rank
@@ Property / cites work @@
+Approximate max-integral-flow/min-multicut theorems
+Normal rank
@@ Property / cites work @@
+Multicommodity flows in planar graphs
@@ Property / cites work: Multicommodity flows in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic construction of deterministic algorithms: approximating packing integer programs
+Normal rank
@@ Property / cites work @@
+Edge Disjoint Paths in Moderately Connected Graphs
+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 @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2009.03.009
@@ Property / DOI: 10.1016/J.DAM.2009.03.009 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:967419