LIPIcs.MFCS.2023.18.pdf
- Filesize: 1.24 MB
- 15 pages
Document
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges
Authors
Carla Binucci 
,
Giuseppe Liotta ,
Fabrizio Montecchiani ,
Giacomo Ortali ,
Tommaso Piselli
-
Part of:
Volume:
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Mathematical Foundations of Computer Science (MFCS) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2023-08-21
File
Document Identifiers
Author Details
Cite As Get BibTex
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, and Tommaso Piselli. On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 18:1-18:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.MFCS.2023.18
Abstract
Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with multiple algorithmic applications. In particular, an st-orientation orients each edge of the input graph such that the resulting digraph is acyclic, and it contains a single source s and a single sink t. Computing an st-orientation of a graph can be done efficiently, and it finds notable applications in graph algorithms and in particular in graph drawing. On the other hand, finding an st-orientation with at most k transitive edges is more challenging and it was recently proven to be NP-hard already when k = 0. We strengthen this result by showing that the problem remains NP-hard even for graphs of bounded diameter, and for graphs of bounded vertex degree. These computational lower bounds naturally raise the question about which structural parameters can lead to tractable parameterizations of the problem. Our main result is a fixed-parameter tractable algorithm parameterized by treewidth.
Subject Classification
ACM Subject Classification
- Theory of computation → Fixed parameter tractability
- Mathematics of computing → Graph algorithms
Keywords
- st-orientations
- parameterized complexity
- graph drawing
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Carla Binucci, Walter Didimo, and Maurizio Patrignani. st-orientations with few transitive edges. In Patrizio Angelini and Reinhard von Hanxleden, editors, GD 2022, volume 13764 of LNCS, pages 201-216. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-22203-0_15.
- Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, and Tommaso Piselli. On the parameterized complexity of computing st-orientations with few transitive edges. CoRR, abs/2306.03196, 2023. URL: https://arxiv.org/abs/2306.03196.
- Hans L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25(6):1305-1317, 1996. URL: https://doi.org/10.1137/S0097539793251219.
- Hans L. Bodlaender and Ton Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms, 21(2):358-402, 1996. URL: https://doi.org/10.1006/jagm.1996.0049.
-
Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, 1999.
- Giuseppe Di Battista and Roberto Tamassia. Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci., 61:175-198, 1988. URL: https://doi.org/10.1016/0304-3975(88)90123-5.
-
Rodney G. Downey and Michael R. Fellows. Parameterized Complexity. Monographs in Computer Science. Springer, 1999.
- Shimon Even and Robert Endre Tarjan. Computing an st-numbering. Theoretical Computer Science, 2(3):339-344, 1976. URL: https://doi.org/10.1016/0304-3975(76)90086-4.
- Michael Kaufmann and Dorothea Wagner, editors. Drawing Graphs, Methods and Models, volume 2025 of LNCS. Springer, 2001. URL: https://doi.org/10.1007/3-540-44969-8.
-
Ton Kloks. Treewidth, Computations and Approximations, volume 842 of LNCS. Springer, 1994.
-
A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In Theory of Graphs: International Symposium., pages 215-232. Gorden and Breach, 1967.
-
Neil Robertson and Paul D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms, 7(3):309-322, 1986.
- Thomas J. Schaefer. The complexity of satisfiability problems. In Proceedings of the Tenth Annual ACM Symposium on Theory of Computing (STOC 1978), pages 216-226. Association for Computing Machinery, 1978. URL: https://doi.org/10.1145/800133.804350.