Vertex Disjoint Paths in Upward Planar Graphs

  • Saeed Akhoondian Amiri
  • Ali Golshani
  • Stephan Kreutzer
  • Sebastian Siebertz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8476)


The k-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed k when restricted to the class of planar digraphs and it was a long standing open question whether it is fixed-parameter tractable (with respect to parameter k) on this restricted class. Only recently, Cygan et al. [5] achieved a major breakthrough and answered the question positively. Despite the importance of this result, it is of rather theoretical importance. Their proof technique is both technically extremely involved and also has a doubly exponential parameter dependence. Thus, it seems unrealistic that the algorithm could actually be implemented. In this paper, therefore, we study a smaller but well studied class of planar digraphs, the class of upward planar digraphs which can be drawn in a plane such that all edges are drawn upwards. We show that on this class the problem (i) remains NP-complete and (ii) problem is fixed-parameter tractable. While membership in FPT follows immediately from [5]’s general result, our algorithm is very natural and has only singly exponential parameter dependence and linear dependence on the graph size, compared to the doubly exponential parameter dependence and much higher polynomial dependence on the graph size for general planar digraphs. Furthermore, our algorithm can easily be implemented, in contrast to the algorithm in [5].


Polynomial Time Planar Graph Disjoint Path Linear Time Algorithm Graph Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bang-Jensen, J., Gutin, G.Z.: Digraphs - Theory, Algorithms and Applications, 2nd edn. Springer (2010)Google Scholar
  2. 2.
    Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)zbMATHGoogle Scholar
  3. 3.
    Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 12(6), 476–497 (1994)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132–169 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M.: The planar directed k-vertex-disjoint paths problem is fixed-parameter tractable. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 197–206 (2013)Google Scholar
  6. 6.
    Diestel, R.: Graph Theory, 3rd edn. Springer (2005)Google Scholar
  7. 7.
    Downey, R., Fellows, M.: Parameterized Complexity. Springer (1998)Google Scholar
  8. 8.
    Fortune, S., Hopcroft, J.E., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10, 111–121 (1980)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Ganian, R., Hliněný, P., Kneis, J., Langer, A., Obdržálek, J., Rossmanith, P.: On digraph width measures in parameterized algorithmics. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 185–197. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  10. 10.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)Google Scholar
  11. 11.
    Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601–625 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. J. Comb. Theory, Ser. B 82(1), 138–154 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Lynch, J.F.: The equivalence of theorem proving and the interconnection problem. ACM SIGDA Newsletter 5(3), 31–36 (1975)CrossRefGoogle Scholar
  14. 14.
    Ohtsuki, T.: The two disjoint path problem and wire routing design. In: Saito, N., Nishizeki, T. (eds.) Graph Theory and Algorithms. LNCS, vol. 108, pp. 207–216. Springer, Heidelberg (1981)CrossRefGoogle Scholar
  15. 15.
    Papakostas, A.: Upward planarity testing of outerplanar dags (extended abstract) (1995), 10.1007/3-540-58950-3_385Google Scholar
  16. 16.
    Robertson, N., Seymour, P.D.: Graph minors XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B 63, 65–110 (1995)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 17.
    Schrijver, A.: Finding k disjoint paths in a directed planar graph. SIAM Jornal on Computing 23(4), 780–788 (1994)CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Seymour, P.D.: Disjoint paths in graphs. Discrete Math. 29, 293–309 (1980)CrossRefzbMATHMathSciNetGoogle Scholar
  19. 19.
    Shiloach, Y.: A polynomial solution to the undirected two paths problem. J. ACM 27, 445–456 (1980)CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Slivkins, A.: Parameterized tractability of edge-disjoint paths on directed acyclic graphs. In: European Symposium on Algorithms, pp. 482–493 (2003)Google Scholar
  21. 21.
    Thomassen, C.: 2-linked graphs. European Journal of Combinatorics 1, 371–378 (1980)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Saeed Akhoondian Amiri
    • 1
  • Ali Golshani
    • 2
  • Stephan Kreutzer
    • 1
  • Sebastian Siebertz
    • 1
  1. 1.Technische Universität BerlinGermany
  2. 2.University of TehranIran

Personalised recommendations