Document Open Access Logo

Coloring and Recognizing Mixed Interval Graphs

Authors Grzegorz Gutowski , Konstanty Junosza-Szaniawski , Felix Klesen , Paweł Rzążewski , Alexander Wolff , Johannes Zink

PDF

File

Thumbnail PDF
PDF
LIPIcs.ISAAC.2023.36.pdf
  • Filesize: 0.94 MB
  • 14 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph theory
Keywords
  • Interval Graphs
  • Mixed Graphs
  • Graph Coloring

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

A mixed interval graph is an interval graph that has, for every pair of intersecting intervals, either an arc (directed arbitrarily) or an (undirected) edge. We are particularly interested in scenarios where edges and arcs are defined by the geometry of intervals. In a proper coloring of a mixed interval graph G, an interval u receives a lower (different) color than an interval v if G contains arc (u,v) (edge {u,v}). Coloring of mixed graphs has applications, for example, in scheduling with precedence constraints; see a survey by Sotskov [Mathematics, 2020].
For coloring general mixed interval graphs, we present a min {ω(G), λ(G)+1}-approximation algorithm, where ω(G) is the size of a largest clique and λ(G) is the length of a longest directed path in G. For the subclass of bidirectional interval graphs (introduced recently for an application in graph drawing), we show that optimal coloring is NP-hard. This was known for general mixed interval graphs.
We introduce a new natural class of mixed interval graphs, which we call containment interval graphs. In such a graph, there is an arc (u,v) if interval u contains interval v, and there is an edge {u,v} if u and v overlap. We show that these graphs can be recognized in polynomial time, that coloring them with the minimum number of colors is NP-hard, and that there is a 2-approximation algorithm for coloring.

Cite As Get BibTex

Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Paweł Rzążewski, Alexander Wolff, and Johannes Zink. Coloring and Recognizing Mixed Interval Graphs. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 36:1-36:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023) https://doi.org/10.4230/LIPIcs.ISAAC.2023.36

Author Details

Grzegorz Gutowski
  • Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków, Poland
Konstanty Junosza-Szaniawski
  • Warsaw University of Technology, Poland
Felix Klesen
  • Universität Würzburg, Germany
Paweł Rzążewski
  • Warsaw University of Technology, Poland
  • Institute of Informatics, University of Warsaw, Poland
Alexander Wolff
  • Universität Würzburg, Germany
Johannes Zink
  • Universität Würzburg, Germany

Funding

  • Gutowski, Grzegorz: partially supported by the National Science Center of Poland under grant no. 2019/35/B/ST6/02472.
  • Zink, Johannes: partially supported by DFG grant Wo 758/11-1.

Acknowledgements

We are indebted to Krzysztof Fleszar, Zbigniew Lonc, Karolina Okrasa, and Marta Piecyk for fruitful discussions. Additionally, we acknowledge the welcoming and productive atmosphere at the workshop Homonolo 2022, where some of the work was done.

References

  1. Matthias Beck, Daniel Blado, Joseph Crawford, Taïna Jean-Louis, and Michael Young. Mixed graph colorings. In Proc. Sci. Nat. Conf. of the Society for Advancement of Hispanics/Chicanos and Native Americans, 2012. Google Scholar
  2. Matthias Beck, Daniel Blado, Joseph Crawford, Taïna Jean-Louis, and Michael Young. On weak chromatic polynomials of mixed graphs. Graphs Combin., 31:91-98, 2015. URL: https://doi.org/10.1007/s00373-013-1381-1.
  3. Peter Brucker. Scheduling Algorithms. Springer, 5 edition, 1995. URL: https://doi.org/10.1007/978-3-540-69516-5.
  4. Dominique de Werra. Restricted coloring models for timetabling. Discrete Math., 165-166:161-170, 1997. URL: https://doi.org/10.1016/S0012-365X(96)00208-7.
  5. Hanna Furmańczyk, Adrian Kosowski, and Paweł Żyliński. A note on mixed tree coloring. Inf. Process. Lett., 106(4):133-135, 2008. URL: https://doi.org/10.1016/j.ipl.2007.11.003.
  6. Hanna Furmańczyk, Adrian Kosowski, and Paweł Żyliński. Scheduling with precedence constraints: Mixed graph coloring in series-parallel graphs. In Proc. PPAM'07, pages 1001-1008, 2008. URL: https://doi.org/10.1007/978-3-540-68111-3_106.
  7. Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Paweł Rzążewski, Alexander Wolff, and Johannes Zink. Coloring and recognizing directed interval graphs. ArXiv report, 2023. URL: https://doi.org/10.48550/arXiv.2303.07960.
  8. Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, and Johannes Zink. Coloring mixed and directional interval graphs. In Patrizio Angelini and Reinhard von Hanxleden, editors, Proc. 30th Int. Symp. Graph Drawing & Network Vis. (GD'22), volume 13764 of LNCS, pages 418-431. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-22203-0_30.
  9. Pierre Hansen, Julio Kuplinsky, and Dominique de Werra. Mixed graph colorings. Math. Methods Oper. Res., 45:145-160, 1997. URL: https://doi.org/10.1007/BF01194253.
  10. George S. Lueker and Kellogg S. Booth. A linear time algorithm for deciding interval graph isomorphism. J. ACM, 26(2):183-195, 1979. URL: https://doi.org/10.1145/322123.322125.
  11. Ross M. McConnell and Jeremy P. Spinrad. Modular decomposition and transitive orientation. Discrete Math., 201(1):189-241, 1999. URL: https://doi.org/10.1016/S0012-365X(98)00319-7.
  12. Bernard Ries and Dominique de Werra. On two coloring problems in mixed graphs. Eur. J. Comb., 29(3):712-725, 2008. URL: https://doi.org/10.1016/j.ejc.2007.03.006.
  13. Paolo Serafini and Walter Ukovich. A mathematical model for the fixed-time traffic control problem. Europ. J. Oper. Res., 42(2):152-165, 1989. URL: https://doi.org/10.1016/0377-2217(89)90318-4.
  14. Yuri N. Sotskov. Mixed graph colorings: A historical review. Mathematics, 8(3):385:1-24, 2020. URL: https://doi.org/10.3390/math8030385.
  15. Yuri N. Sotskov, Vjacheslav S. Tanaev, and Frank Werner. Scheduling problems and mixed graph colorings. Optimization, 51(3):597-624, 2002. URL: https://doi.org/10.1080/0233193021000004994.
  16. Yuri N. Sotskov and Vyacheslav S. Tanaev. Chromatic polynomial of a mixed graph. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 6:20-23, 1976. Google Scholar
  17. Kozo Sugiyama, Shojiro Tagawa, and Mitsuhiko Toda. Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern., 11(2):109-125, 1981. URL: https://doi.org/10.1109/TSMC.1981.4308636.
  18. Vjacheslav S. Tanaev, Yuri N. Sotskov, and V.A. Strusevich. Scheduling Theory: Multi-Stage Systems. Kluwer Academic Publishers, 1994. Google Scholar
  19. Johannes Zink, Julian Walter, Joachim Baumeister, and Alexander Wolff. Layered drawing of undirected graphs with generalized port constraints. Comput. Geom., 105-106(101886):1-29, 2022. URL: https://doi.org/10.1016/j.comgeo.2022.101886.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact