Abstract
An independent dominating set in a graph is a subset of vertices, such that no edge has both ends in the subset, and each vertex either itself is in the subset or has a neighbor in the subset. In a convex bipartite (circular convex bipartite, triad convex bipartite, respectively) graph, there is a linear ordering (a circular ordering, a triad, respectively) defined on one class of vertices, such that for every vertex in the other class, the neighborhood of this vertex is an interval (a circular arc, a subtree, respectively), where a triad is three paths with a common end. The problem of finding a minimum independent dominating set, called independent domination, is known \(\mathcal{NP}\)-complete for bipartite graphs and tractable for convex bipartite graphs. In this paper, we make polynomial time reductions for independent domination from triad- and circular-convex bipartite graphs to convex bipartite graphs.
Partially supported by National 973 Program of China (Grant No. 2010CB328103).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bao, F.S., Zhang, Y.: A review of tree convex sets test. Comput. Intell. 28(3), 358–372 (2012), Old version: A survey of tree convex sets test. arXiv.0906.0205 (2009)
Chen, D.Z., Liu, X., Wang, H.: Computing maximum non-crossing matching in convex bipartite graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) FAW-AAIM 2012. LNCS, vol. 7285, pp. 105–116. Springer, Heidelberg (2012)
Damaschke, P., Müller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Inf. Process. Lett. 36(5), 231–236 (1990)
Dom, M.: Algorithmic aspects of the consecutive ones property. Bulletin of the EATCS 98, 27–59 (2009)
Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979)
Golumbic, M.C., Goss, C.F.: Perfect elimination and chordal bipartite graphs. J. Graph Theory 2, 155–163 (1978)
Grover, F.: Maximum matching in a convex bipartite graph. Nav. Res. Logist. Q. 14, 313–316 (1967)
Jiang, W., Liu, T., Ren, T., Xu, K.: Two hardness results on feedback vertex sets. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol. 6681, pp. 233–243. Springer, Heidelberg (2011)
Jiang, W., Liu, T., Wang, C., Xu, K.: Feedback vertex sets on restricted bipartite graphs. Theor. Comput. Sci (in press, 2013), doi:10.1016/j.tcs.2012.12.021
Jiang, W., Liu, T., Xu, K.: Tractable feedback vertex sets in restricted bipartite graphs. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 424–434. Springer, Heidelberg (2011)
Liang, Y.D., Blum, N.: Circular convex bipartite graphs: maximum matching and Hamiltonian circuits. Inf. Process. Lett. 56, 215–219 (1995)
Lu, Z., Liu, T., Xu, K.: Tractable connected domination for restricted bipartite graphs. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 721–728. Springer, Heidelberg (2013)
Müller, H., Brandstät, A.: The NP-completeness of steiner tree and dominating set for chordal bipartite graphs. Theor. Comput. Sci. 53(2-3), 257–265 (1987)
Song, Y., Liu, T., Xu, K.: Independent domination on tree convex bipartite graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) FAW-AAIM 2012. LNCS, vol. 7285, pp. 129–138. Springer, Heidelberg (2012)
Wang, C., Liu, T., Jiang, W., Xu, K.: Feedback vertex sets on tree convex bipartite graphs. In: Lin, G. (ed.) COCOA 2012. LNCS, vol. 7402, pp. 95–102. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, M., Liu, T., Xu, K. (2013). Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs. In: Fellows, M., Tan, X., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7924. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38756-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-38756-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38755-5
Online ISBN: 978-3-642-38756-2
eBook Packages: Computer ScienceComputer Science (R0)