NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs
In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match the given sequence. This realization problem is known to be polynomial-time solvable when the graph is directed or undirected. In contrast, we show NP-completeness for the problem of realizing a given sequence of pairs of positive integers (representing indegrees and outdegrees) with a directed acyclic graph, answering an open question of Berger and Müller-Hannemann [FCT 2011]. Furthermore, we classify the problem as fixed-parameter tractable with respect to the parameter “maximum degree”.
Keywordsgraph realization problems combinatorial algorithms parameterized complexity realizing topological orderings
Unable to display preview. Download preview PDF.
- 2.Berger, A., Müller-Hannemann, M.: How to Attack the NP-Complete Dag Realization Problem in Practice. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 51–62. Springer, Heidelberg (2012)Google Scholar
- 4.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)Google Scholar
- 5.Erdős, P., Gallai, T.: Graphs with prescribed degrees of vertices. Math. Lapok 11, 264–274 (1960) (in Hungarian)Google Scholar
- 6.Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)Google Scholar
- 9.Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)Google Scholar
- 15.Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)Google Scholar
- 16.Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proc. 27th STACS. LIPIcs, vol. 5, pp. 17–32. IBFI Dagstuhl, Germany (2010)Google Scholar