Abstract
A bipartite graph G(X, Y) whose vertex set is partitioned into X and Y is a convex bipartite graph, if there is an ordering of \(X=(x_1,\ldots ,x_m)\) such that for all \(y \in Y\), \(N_G(y)\) is consecutive with respect to the ordering of X, and G is said to have convexity with respect to X. A k-star caterpillar is a tree with a collection of stars with each star having k vertices of degree one whose roots are joined by a path. For a bipartite graph with partitions X and Y, we associate a k-star caterpillar on X such that for each vertex in Y, its neighborhood induces a tree. The minimum Steiner tree problem (STREE) is defined as follows: given a connected graph \(G=(V,E)\) and a subset of vertices \(R \subseteq V(G)\), the objective is to find a minimum cardinality set \(S \subseteq V(G)\) such that the set \(R \cup S\) induces a connected subgraph. In this paper, we present the following dichotomy result: we show that STREE is NP-complete for 1-star caterpillar convex bipartite graphs and polynomial-time solvable for 0-star caterpillar convex bipartite graphs (also known as convex bipartite graphs). We also strengthen the well-known result of Müller and Brandstädt (Theoret Comput Sci 53(2-3):257-265, 1987), which says STREE in chordal bipartite graphs is NP-complete (reduction instances are 3-star caterpillar convex bipartite graphs). As an application, we use our STREE results to solve: (i) the classical dominating set problem in convex bipartite graphs, (ii) STREE on interval graphs, linear time.
Similar content being viewed by others
Data availability
Enquiries about data availability should be directed to the authors.
References
Booth KS, Lueker GS (1975) Linear algorithms to recognize interval graphs and test for the consecutive ones property. In: Proceedings of the seventh annual ACM symposium on Theory of computing. pp255–265
Chen H, Lei Z, Liu T, Tang Z, Wang C, Ke X (2016) Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs. J Comb Optim 32(1):95–110
Colbourn CJ, Stewart LK (1990) Permutation graphs: connected domination and Steiner trees. Discrete Math 86(1–3):179–189
Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT press, Cambridge
Cygan M, Fomin FV, Kowalik Ł, Lokshtanov D, Marx D, Pilipczuk M, Pilipczuk M, Saurabh S (2015) Parameterized algorithms. Springer, Cham
Damaschke P, Müller H, Kratsch D (1990) Domination in convex and chordal bipartite graphs. Inf Process Lett 36(5):231–236
D’Atri A, Moscarini M (1988) Distance-hereditary graphs, Steiner trees, and connected domination. SIAM J Comput 17(3):521–538
Dom M, Lokshtanov D, Saurabh S (2009) Incompressibility through colors and IDs. In: International colloquium on automata, languages, and programming. Springer. 378–389
Dreyfus SE, Wagner RA (1971) The Steiner problem in graphs. Networks 1(3):195–207
Garey MR (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman & Co, New York
Grigoreva DR, Faizullina AG, Basyrov RR, Sharipov RS (2015) Use of Steiner problem in solving practical problems of road construction. Modern Appl Sci 9(4):294
Hwang FK, Richards DS, Winter P, Widmayer P (1995) The Steiner tree problem, annals of discrete mathematics. ZOR-Methods Models Oper Res 41(3):382
Kashiwabara T, Masuda S, Nakajima K, Fujisawa T (1992) Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph. J Algorithms 13(1):161–174
Louis Hakimi S (1971) Steiner’s problem in graphs and its implications. Networks 1(2):113–133
Martin Charles Golumbic (2004) Algorithmic graph theory and perfect graphs. Elsevier, Amsterdam
Miehle W (1958) Link-length minimization in networks. Oper Res 6(2):232–243
Müller H, Brandstädt A (1987) The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs. Theoret Comput Sci 53(2–3):257–265
Renjith P, Sadagopan N (2020) The Steiner tree in \(K_{1, r}\)-free split graphs-A Dichotomy. Discret Appl Math 280:246–255
West DB (2001) Introduction to graph theory. Prentice hall, Hoboken
White K, Farber M, Pulleyblank W (1985) Steiner trees, connected domination and strongly chordal graphs. Networks 15(1):109–124
Funding
The study was partially funded by Department of Science and Technology for Early Career Research Award Project-ECR/2017/001442.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work is partially supported by DST-ECRA Project- ECR/2017/001442.
Rights and permissions
About this article
Cite this article
Aneesh, D.H., Mohanapriya, A., Renjith, P. et al. Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy. J Comb Optim 44, 1221–1247 (2022). https://doi.org/10.1007/s10878-022-00884-9
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-022-00884-9