Abstract
Given a digraph G, a set \(X\subseteq V(G)\) is said to be an absorbing set (resp. dominating set) if every vertex in the graph is either in X or is an in-neighbour (resp. out-neighbour) of a vertex in X. A set \(S\subseteq V(G)\) is said to be an independent set if no two vertices in S are adjacent in G. A kernel (resp. solution) of G is an independent and absorbing (resp. dominating) set in G. The problem of deciding if there is a kernel (or solution) in an input digraph is known to be NP-complete. Similarly, the problems of computing a minimum cardinality dominating set or absorbing set or kernel, and the problems of computing a maximum cardinality independent set or kernel, are all known to be NP-hard for general digraphs. We explore the algorithmic complexity of these problems in the well known class of interval digraphs. A digraph G is an interval digraph if a pair of intervals \((S_u,T_u)\) can be assigned to each vertex u of G such that \((u,v)\in E(G)\) if and only if \(S_u\cap T_v\ne \emptyset \). Many different subclasses of interval digraphs have been defined and studied in the literature by restricting the kinds of pairs of intervals that can be assigned to the vertices. We observe that several of these classes, like interval catch digraphs, interval nest digraphs, adjusted interval digraphs and chronological interval digraphs, are subclasses of the more general class of reflexive interval digraphs—which arise when we require that the two intervals assigned to a vertex have to intersect. We see as our main contribution the identification of the class of reflexive interval digraphs as an important class of digraphs. We show that while the problems mentioned above are NP-complete, and even hard to approximate, on interval digraphs (even on some very restricted subclasses of interval digraphs called point-point digraphs, where the two intervals assigned to each vertex are required to be degenerate), they are all efficiently solvable, in most of the cases linear-time solvable, in the class of reflexive interval digraphs. The results we obtain improve and generalize several existing algorithms and structural results for subclasses of reflexive interval digraphs. In particular, we obtain a vertex ordering characterization of reflexive interval digraphs that implies the existence of an \(O(n+m)\) time algorithm for computing a maximum cardinality independent set in a reflexive interval digraph, improving and generalizing the earlier known O(nm) time algorithm for the same problem for the interval nest digraphs. (Here m denotes the number of edges in the digraph not counting the self-loops.) We also show that reflexive interval digraphs are kernel-perfect and that a kernel in such digraphs can be computed in linear time. This generalizes and improves an earlier result that interval nest digraphs are kernel-perfect and that a kernel can be computed in such digraphs in O(nm) time. The structural characterizations that we show for point-point digraphs, apart from helping us construct the NP-completeness/APX-hardness reductions, imply that these digraphs can be recognized in linear time. We also obtain some new results for undirected graphs along the way: (a) We describe an \(O(n(n+m))\) time algorithm for computing a minimum cardinality (undirected) independent dominating set in cocomparability graphs, which slightly improves the existing \(O(n^3)\) time algorithm for the same problem by Kratsch and Stewart; and (b) We show that the Red-Blue Dominating Set problem, which is NP-complete even for planar bipartite graphs, is linear-time solvable on interval bigraphs, which is a class of bipartite (undirected) graphs closely related to interval digraphs.
Similar content being viewed by others
References
Abbas, M., Saoula, Y.: Polynomial algorithms for kernels in comparability, permutation and \(P_4\)-free graphs. 4OR 3(3), 217–225 (2005)
Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs. Algorithmica 33(4), 461–493 (2002)
Alon, N., Brightwell, G.: Hal A Kierstead, Alexandr V Kostochka, and Peter Winkler. Dominating sets in \(k\)-majority tournaments. J. Comb. Theory. Series B 96(3), 374–387 (2006)
Berge, C., Duchet, P.: Recent problems and results about kernels in directed graphs. Discrete Math. 86(1–3), 27–31 (1990)
Berge, C, Minieka, E: Graphs and Hypergraphs. North-Holland Publishing Company (1973)
Blidia, M., Duchet, P., Maffray, F.: On kernels in perfect graphs. Combinatorica 13(2), 231–233 (1993)
Bogart, K.P., Trenk, A.N.: Bounded bitolerance digraphs. Discrete Math. 215(1–3), 13–20 (2000)
Boros, E., Gurvich, V.: Perfect graphs are kernel solvable. Discrete Math. 159(1–3), 35–55 (1996)
Boros, E., Gurvich, V.: Perfect graphs, kernels, and cores of cooperative games. Discrete Math. 306(19–20), 2336–2354 (2006)
Chlebík, M., Chlebíková, J.: The complexity of combinatorial optimization problems on \(d\)-dimensional boxes. SIAM J. Discrete Math. 21(1), 158–169 (2007)
Chudnovsky, M., Kim, R., Liu, C.-H., Seymour, P., Thomassé, S.: Domination in tournaments. J Comb. Theory Series B 130, 98–113 (2018)
Chvátal, V: On the computational complexity of finding a kernel. Report CRM-300, Centre de Recherches Mathématiques, Université de Montréal, 592 (1973)
Damaschke, P: Forbidden ordered subgraphs. In Rainer Bodendiek and Rudolf Henn, editors, Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel, pages 219–229. Physica-Verlag HD, Heidelberg (1990)
Das, S., Francis, M., Hell, P., Huang, J.: Recognition and characterization of chronological interval digraphs. The Electronic Journal of Combinatorics, page P5 (2013)
Das, S., Sen, M.K., Roy, A. B., West, D.B.: Interval digraphs: An analogue of interval graphs. J. Graph Theory 13(2), 189–202 (1989)
de Gevigney, O.D., Meunier, F., Popa, C., Reygner, J., Romero, A.: Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree. 4OR 9(2), 175–188 (2011)
De La Vega, W.F.: Kernels in random graphs. Discrete Math. 82(2), 213–217 (1990)
Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In International Colloquium on Automata, Languages, and Programming, pages 378–389. Springer (2009)
Duchet, P.: A sufficient condition for a digraph to be kernel-perfect. J. Graph Theory 11(1), 81–85 (1987)
Feder, T., Hell, P., Huang, J., Rafiey, A.: Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discrete Appl. Math. 160(6), 697–707 (2012)
Fraenkel, A.S.: Planar kernel and grundy with \(d\le 3\), \(d_{out}\le 2\), \(d_{in}\le 2\) are NP-complete. Discrete Appl. Math. 3(4), 257–262 (1981)
Gale, D., Shapley, L.: College admissions and the stability of marriage. American Math. Monthly 69(1), 9–15 (1962)
Galeana-Sánchez, H., Neumann-Lara, V.: On kernels and semikernels of digraphs. Discrete Math. 48(1), 67–76 (1984)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Mathematical Sciences Series. W. H. Freeman (1979)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Volume 2: Advanced Topics. Chapman & Hall/CRC Pure and Applied Mathematics. Taylor & Francis (1998)
Hayward, R.B., Spinrad, J., Sritharan, R.: Weakly chordal graph algorithms via handles. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’00, pages 42–49, USA, 2000. Society for Industrial and Applied Mathematics
Jaffke, L., Kwon, O.-j., Telle, J.A.: Classes of intersection digraphs with good algorithmic properties. arXiv preprint arXiv:2105.01413 (2021)
Köhler, E., Mouatadid, L.: A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs. Information Processing Letters 116(6), 391–395 (2016)
Kratsch, D., Stewart, L.: Domination on cocomparability graphs. SIAM J. Discrete Math. 6(3), 400–417 (1993)
Liu, C.-H., Poon, S.-H., Lin, J.-Y.: Independent dominating set problem revisited. Theor. Comput. Sci. 562, 1–22 (2015)
Maehara, H.: A digraph represented by a family of boxes or spheres. J. Graph Theory 8(3), 431–439 (1984)
Maffray, F.: On kernels in i-triangulated graphs. Discrete Math. 61(2–3), 247–251 (1986)
Maffray, F.: Kernels in perfect line-graphs. J. Comb. Theory Series B 55(1), 1–8 (1992)
McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Math. 201(1–3), 189–241 (1999)
Megiddo, N., Vishkin, U.: On finding a minimum dominating set in a tournament. Theor. Comput. Sci. 61(2–3), 307–316 (1988)
Morgenstern, O., Von Neumann, J.: Theory of games and economic behavior. Princeton University press (1953)
Müller, H.: Recognizing interval digraphs and interval bigraphs in polynomial time. Discrete Appl. Math. 78(1–3), 189–205 (1997)
Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425–440 (1991)
Pass-Lanneau, A., Igarashi, A., Meunier, F.: Perfect graphs with polynomially computable kernels. Discrete Appl. Math. 272, 69–74 (2020)
Prisner, E.: A characterization of interval catch digraphs. Discrete Math. 73(3), 285–289 (1989)
Prisner, E.: Algorithms for interval catch digraphs. Discrete Appl. Math. 51(1–2), 147–157 (1994)
Rafiey, A.: Recognizing interval bigraphs by forbidden patterns. J. Graph Theory 100(3), 504–529 (2022)
Reid, K.B., McRae, A.A., Hedetniemi, S.M., Hedetniemi, S.T.: Domination and irredundance in tournaments. Australasian J. Comb. 29, 157–172 (2004)
Richardson, M.: On weakly ordered systems. Bull. American Math. Soc. 52(2), 113–116 (1946)
Richardson, Moses: Extension theorems for solutions of irreflexive relations. Proceedings of the National Academy of Sciences of the United States of America 39(7), 649 (1953)
Richardson, M.: Solutions of irreflexive relations. Annals of Mathematics, pages 573–590 (1953)
Takaoka, A.: A recognition algorithm for adjusted interval digraphs. Discrete Appl. Math. 294, 253–256 (2021)
Weihe, K: Covering trains by stations or the power of data reduction, pp. 1–8. In Proceedings of Algorithms and Experiments, ALEX (1998)
Acknowledgements
Pavol Hell would like to gratefully acknowledge support from an NSERC Discovery Grant. Part of the work done by Pavol Hell was also supported by the Smt Rukmini Gopalakrishnachar Chair Professorship at the Indian Institute of Science (November–December, 2019).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Francis, M.C., Hell, P. & Jacob, D. On the Kernel and Related Problems in Interval Digraphs. Algorithmica 85, 1522–1559 (2023). https://doi.org/10.1007/s00453-022-01010-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-022-01010-1