Skip to main content
SpringerLink
Log in

Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

The problem Max W-Light (Max W-Heavy) for an undirected graph is to assign a direction to each edge so that the number of vertices of outdegree at most W (resp. at least W) is maximized. It is known that these problems are NP-hard even for fixed W. For example, Max 0-Light is equivalent to the problem of finding a maximum independent set. In this paper, we show that for any fixed constant W, Max W-Heavy can be solved in linear time for hereditary graph classes for which treewidth is bounded by a function of degeneracy. We show that such graph classes include chordal graphs, circular-arc graphs, d-trapezoid graphs, chordal bipartite graphs, and graphs of bounded clique-width. To have a polynomial-time algorithm for Max W-Light, we need an additional condition of a polynomial upper bound on the number of potential maximal cliques to apply the metatheorem by Fomin et al. (SIAM J Comput 44:54–87, 2015). The aforementioned graph classes, except bounded clique-width graphs, satisfy such a condition. For graphs of bounded clique-width, we present a dynamic programming approach not using the metatheorem to show that it is actually polynomial-time solvable for this graph class too. We also study the parameterized complexity of the problems and show some tractability and intractability results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. We consider parameterized complexity in Sect. 5 where the equivalence does not hold.

  2. The ordinary MSO is enough for our purpose. We introduce CMSO to precisely state Proposition 3.4.

  3. The result is presented in a more general way in the original paper (see [2, Theorem 1]).

References

  1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308–340 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  2. Asahiro, Y., Jansson, J., Miyano, E., Ono, H.: Upper and lower degree bounded graph orientation with minimum penalty. In Eighteenth Computing: The Australasian Theory Symposium, CATS 2012, vol. 128 of CRPIT, pp. 139–146. Australian Computer Society (2012)

  3. Asahiro, Y., Jansson, J., Miyano, E., Ono, H.: Graph orientations optimizing the number of light or heavy vertices. J. Graph Algorithms Appl. 19(1), 441–465 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  4. Asahiro, Y., Jansson, J., Miyano, E., Ono, H.: Degree-constrained graph orientation: maximum satisfaction and minimum violation. Theory Comput. Syst. 58(1), 60–93 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  5. Asahiro, Y., Jansson, J., Miyano, E., Ono, H., Zenmyo, K.: Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. 22(1), 78–96 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Asahiro, Y., Miyano, E., Ono, H., Zenmyo, K.: Graph orientation algorithms to minimize the maximum outdegree. Int. J. Found. Comput. Sci. 18(2), 197–215 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bodlaender, H.L., Heggernes, P., Telle, J.A.: Recognizability equals definability for graphs of bounded treewidth and bounded chordality. Electr. Notes Discrete Math. 49, 559–568 (2015)

    Article  MATH  Google Scholar 

  8. Bodlaender, H.L., Kloks, T., Kratsch, D., Müller, H.: Treewidth and minimum fill-in on \(d\)-trapezoid graphs. J. Graph Algorithms Appl. 2(5), 1–23 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bouchitté, V., Todinca, I.: Listing all potential maximal cliques of a graph. Theor. Comput. Sci. 276(1–2), 17–32 (2002)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Chung, F.R.K., Garey, M.R., Tarjan, R.E.: Strongly connected orientations of mixed multigraphs. Networks 15(4), 477–484 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  12. Corneil, D.G., Rotics, U.: On the relationship between clique-width and treewidth. SIAM J. Comput. 34(4), 825–847 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Courcelle, B.: The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. Theor. Inform. Appl. 26, 257–286 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  14. Courcelle, B.: The monadic second-order logic of graphs VIII: orientations. Ann. Pure Appl. Logic 72(2), 103–143 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  15. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125–150 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  16. Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101(1–3), 77–114 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)

    Book  MATH  Google Scholar 

  18. Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-width is NP-complete. SIAM J. Discrete Math. 23(2), 909–939 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  19. Fomin, F.V., Todinca, I., Villanger, Y.: Large induced subgraphs via triangulations and CMSO. SIAM J. Comput. 44(1), 54–87 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  20. Frank, A., Gyárfás, A.: How to orient the edges of a graph? In: Combinatorics (Proceedings of the 5th Hungarian Combinatorial Colloquium, Keszthely, 1976), vol. 18 of Colloquia mathematica Societatis Janos Bolyai, pp. 353–364 (1978)

  21. Gabow, H.N.: Upper degree-constrained partial orientations. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, pp. 554–563 (2006)

  22. Gaspers, S., Kratsch, D., Liedloff, M., Todinca, I.: Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Trans. Algorithms 6, Article No. 9 (2009)

  23. Gurski, F., Wanke, E.: The tree-width of clique-width bounded graphs without \(K_{n,n}\). In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, vol. 1928 of Lecture Notes in Computer Science, pp. 196–205 (2000)

  24. Habib, M., Möhring, R.H.: Treewidth of cocomparability graphs and a new order-theoretic parameter. Order 11(1), 47–60 (1994)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  26. Heggernes, P.: Treewidth, partial \(k\)-trees, and chordal graphs. Partial curriculum in INF334—advanced algorithmical techniques, Department of Informatics, University of Bergen, Norway (2005)

  27. Jaffke, L., Bodlaender, H.L.: Definability equals recognizability for k-outerplanar graphs. In: 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, September 16–18, 2015, Patras, Greece, vol. 43 of LIPIcs, pp. 175–186 (2015)

  28. Khoshkhah, K.: On finding orientations with the fewest number of vertices with small out-degree. Discrete Appl. Math. 194, 163–166 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  29. Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci. 289(2), 997–1008 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  30. Kloks, T., Kratsch, D.: Treewidth of chordal bipartite graphs. J. Algorithms 19(2), 266–281 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  31. Kloks, T., Kratsch, D., Wong, C.K.: Minimum fill-in on circle and circular-arc graphs. J. Algorithms 28(2), 272–289 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  32. Kloks, T., Liu, C.-H., Poon, S.-H.: Feedback vertex set on chordal bipartite graphs. CoRR, arXiv:1104.3915 (2011)

  33. Kosowski, A., Li, B., Nisse, N., Suchan, K.: \(k\)-chordal graphs: from cops and robber to compact routing via treewidth. Algorithmica 72(3), 758–777 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  34. Kratsch, D.: The Structure of Graphs and the Design of Efficient Algorithms. Habilitation thesis, Friedrich-Schiller-University of Jena, Germany (1996)

  35. Landau, H.G.: On dominance relations and the structure of animal societies: III the condition for a score structure. Bull. Math. Biol. 15(2), 143–148 (1953)

    MathSciNet  Google Scholar 

  36. Lekkerkerker, C.G., Boland, J.C.: Representation of a finite graph by a set of intervals on the real line. Fund. Math. 51(1), 45–64 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  37. Mathieson, L.: The parameterized complexity of editing graphs for bounded degeneracy. Theor. Comput. Sci. 411(34–36), 3181–3187 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  38. Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417–427 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  39. Milanič, M.: Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs. Ph.D. thesis, Rutgers University (2007)

  40. Nash-Williams, C.S.J.A.: On orientations, connectivity and odd vertex pairings in finite graphs. Canad. J. Math 12, 555–567 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  41. Oum, S.-I.: Approximating rank-width and clique-width quickly. ACM Trans. Algorithms 5, Article No. 10 (2008)

  42. Oum, S., Seymour, P.D.: Approximating clique-width and branch-width. J. Comb. Theory Ser. B 96, 514–528 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  43. Pilipczuk, M., Pilipczuk, M.: Finding a maximum induced degenerate subgraph faster than \(2^{n}\). In: Parameterized and Exact Computation—7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12–14, 2012. Proceedings, vol. 7535 of Lecture Notes in Computer Science, pp. 3–12 (2012)

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

    Article  MATH  Google Scholar 

  45. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer, Berlin (2003)

    MATH  Google Scholar 

  46. Stanley, R.P.: Acyclic orientations of graphs. Discrete Math. 5(2), 171–178 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  47. Venkateswaran, V.: Minimizing maximum indegree. Discrete Appl. Math. 143(1–3), 374–378 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors thank the anonymous reviewers for constructive comments that improved the presentation of the paper.

Author information

Authors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands

    Hans L. Bodlaender

  2. Department of Mathematics and Computer Science, University of Technology Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Hans L. Bodlaender

  3. Graduate School of Informatics, Nagoya University, Furo-cho, Chikusa-ku, Nagoya, 464-8601, Japan

    Hirotaka Ono

  4. Faculty of Advanced Science and Technology, Kumamoto University, 2-39-1 Kurokami, Chuo-ku, Kumamoto, 860-8555, Japan

    Yota Otachi

Authors
  1. Hans L. Bodlaender
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hirotaka Ono
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yota Otachi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yota Otachi.

Additional information

Partially supported by NETWORKS project and by MEXT/JSPS KAKENHI Grant Numbers 24106004, 24220003, 25730003, 26540005. Yota Otachi was partially supported by FY 2015 Researcher Exchange Program between JSPS and NSERC.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bodlaender, H.L., Ono, H. & Otachi, Y. Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. Algorithmica 80, 2160–2180 (2018). https://doi.org/10.1007/s00453-017-0399-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-017-0399-9

Keywords

Search

Navigation