Abstract
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”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berger, A., Müller-Hannemann, M.: Dag Realizations of Directed Degree Sequences. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 264–275. Springer, Heidelberg (2011)
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)
Chen, W.K.: On the realization of a (p,s)-digraph with prescribed degrees. J. Franklin Inst. 281(5), 406–422 (1966)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)
Erdős, P., Gallai, T.: Graphs with prescribed degrees of vertices. Math. Lapok 11, 264–274 (1960) (in Hungarian)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)
Fulkerson, D.: Zero-one matrices with zero trace. Pacific J. Math. 10(3), 831–836 (1960)
Gale, D.: A theorem on flows in networks. Pacific J. Math. 7, 1073–1082 (1957)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)
Hakimi, S.: On realizability of a set of integers as degrees of the vertices of a linear graph. i. J. SIAM 10(3), 496–506 (1962)
Havel, V.: A remark on the existence of finite graphs. Casopis Pest. Mat. 80, 477–480 (1955)
Hulett, H., Will, T.G., Woeginger, G.J.: Multigraph realizations of degree sequences: Maximization is easy, minimization is hard. Oper. Res. Lett. 36(5), 594–596 (2008)
Kleitman, D., Wang, D.: Algorithms for constructing graphs and digraphs with given valences and factors. SIAM J. Discrete Math. 6(1), 79–88 (1973)
Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Deconstructing intractability—a multivariate complexity analysis of interval constrained coloring. J. Discrete Algorithms 9(1), 137–151 (2011)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)
Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proc. 27th STACS. LIPIcs, vol. 5, pp. 17–32. IBFI Dagstuhl, Germany (2010)
Ryser, H.: Combinatorial properties of matrices of zeros and ones. Canadian J. Math. 9, 371–377 (1957)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hartung, S., Nichterlein, A. (2012). NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. In: Cooper, S.B., Dawar, A., Löwe, B. (eds) How the World Computes. CiE 2012. Lecture Notes in Computer Science, vol 7318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30870-3_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-30870-3_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30869-7
Online ISBN: 978-3-642-30870-3
eBook Packages: Computer ScienceComputer Science (R0)