Skip to main content

Degree-constrained orientations of embedded graphs

Abstract

We investigate the problem of orienting the edges of an embedded graph in such a way that the resulting digraph fulfills given in-degree specifications both for the vertices and for the faces of the embedding. This primal-dual orientation problem was first proposed by Frank for the case of planar graphs, in conjunction with the question for a good characterization of the existence of such orientations. We answer this question by showing that a feasible orientation of a planar embedding, if it exists, can be constructed by combining certain parts of a primally feasible orientation and a dually feasible orientation. For the general case of arbitrary embeddings, we show that the number of feasible orientations is bounded by \(2^{2g}\), where \(g\) is the genus of the embedding. Our proof also yields a fixed-parameter algorithm for determining all feasible orientations parameterized by the genus. In contrast to these positive results, however, we also show that the problem becomes \(N\!P\)-complete even for a fixed genus if only upper and lower bounds on the in-degrees are specified instead of exact values.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Notes

  1. A good characterization good characterization of a decision problem in the sense of Edmonds (1965) is a description of polynomially verifiable certificates for both yes- and no-instances of the problem.

  2. Personal communication at the Seminar of the Egerváry research group on combinatorial optimization, February 2010.

  3. A simple cut is a cut whose edge set is minimal w.r.t. inclusion. In a connected graph, a cut is simple if and only if it splits the graph into two connected components.

  4. The term “rigid” for edges that are oriented in an identical way in all feasible orientations was introduced by Felsner (2004).

  5. Personal communication during the Colloquium on Combinatorics 2012.

References

  • Arulselvan A, Groß M, Skutella M (2014) Graph orientation and flows over time. In: Algorithms and computation. Lecture notes in computer science. Springer, Berlin (to appear)

  • Asahiro Y, Jansson J, Miyano E, Ono H (2012) Upper and lower degree bounded graph orientation with minimum penalty. In: Proceedings of the 18th computing: the australasian theory symposium, vol 128, pp 139–146.

  • Biedl T, Chan T, Ganjali Y, Hajiaghayi MT, Wood DR (2005) Balanced vertex-orderings of graphs. Discret Appl Math 148(1):27–48

    MathSciNet  Article  MATH  Google Scholar 

  • Borradaile G, Klein PN, Mozes S, Nussbaum Y, Wulff-Nilsen C (2011) Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time. In: Proceedings of the 52nd annual symposium on foundations of computer science, pp 170–179.

  • Chrobak M, Eppstein D (1991) Planar orientations with low out-degree and compaction of adjacency matrices. Theoret Comput Sci 86(2):243–266

    MathSciNet  Article  MATH  Google Scholar 

  • Dinic EA (1970) Algorithm for solution of a problem of maximum flow in networks with power estimation. In: Soviet Mathematics Doklady 11:1277–1280

  • Disser Y, Matuschke J (2012) Degree-constrained orientations of embedded graphs. In: Algorithms and computation. Lecture notes in computer science, vol 7676. Springer, Berlin, pp 506–516

  • Eades P, Wormald NC (1990) Fixed edge-length graph drawing is NP-hard. Discret Appl Math 28(2):111–134

    MathSciNet  Article  MATH  Google Scholar 

  • Edmonds J (1965) Minimum partition of a matroid into independent subsets. J Res Natl Bureau Stand Ser B 69:67–72

    MathSciNet  Article  MATH  Google Scholar 

  • Felsner S (2004) Lattice structures from planar graphs. J Combin 11(1):R15

    MathSciNet  Google Scholar 

  • Frank A, Gyárfás A (1976) How to orient the edges of a graph? Colloquia Mathematica Societatis Janos Bolyai 18:353–364

    Google Scholar 

  • Frank A, Király T, Király Z (2003) On the orientation of graphs and hypergraphs. Discret Appl Math 131(2):385–400

    Article  MATH  Google Scholar 

  • Gabow HN (2006) Upper degree-constrained partial orientations. In: Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithm, pp 554–563

  • Hakimi S (1965) On the degrees of the vertices of a directed graph. J Franklin Inst 279(4):290–308

    MathSciNet  Article  MATH  Google Scholar 

  • Hausknecht M, Au T, Stone P, Fajardo D, Waller T (2011) Dynamic lane reversal in traffic management. In: 14th international IEEE conference on intelligent transportation systems, pp 1929–1934

  • Lichtenstein D (1982) Planar formulae and their uses. SIAM J Comput 11(2):329–343

    MathSciNet  Article  MATH  Google Scholar 

  • Nash-Williams CSJ (1960) On orientations, connectivity and odd vertex pairings in finite graphs. Can J Math 12(8):555–567

    MathSciNet  Article  MATH  Google Scholar 

  • Rebennack S, Arulselvan A, Elefteriadou L, Pardalos PM (2010) Complexity analysis for maximum flow problems with arc reversals. J Combin Optim 19(2):200–216

    MathSciNet  Article  MATH  Google Scholar 

  • Robbins H (1939) A theorem on graphs, with an application to a problem of traffic control. Am Math Monthly 46(5):281–283

    Article  Google Scholar 

  • Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146–160

    MathSciNet  Article  MATH  Google Scholar 

  • Whitney H (1932) Non-separable and planar graphs. Trans Am Math Soc 34(2):339–362

    MathSciNet  Article  Google Scholar 

  • Wolshon B (2001) “One-Way-Out”: contraflow freeway operation for hurricane evacuation. Nat Hazards Rev 2:105

    Article  Google Scholar 

Download references

Acknowledgments

We thank Kristóf Bérczi and Júlia Pap for introducing us to this interesting topic and providing many helpful suggestions. This work was supported by the Alexander von Humboldt Foundation, by the Berlin Mathematical School and by Deutsche Forschungsgemeinschaft as part of the Priority Program “Algorithm Engineering” (1307).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jannik Matuschke.

Additional information

An extended abstract of this article has appeared in the proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC 2012), Taipei, 2012 (Disser and Matuschke 2012).

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Disser, Y., Matuschke, J. Degree-constrained orientations of embedded graphs. J Comb Optim 31, 758–773 (2016). https://doi.org/10.1007/s10878-014-9786-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-014-9786-1

Keywords

  • Graph orientation
  • Graph embeddings
  • Planar graphs
  • Fixed-parameter tractability
  • Complexity theory