Abstract
We study the problem of adding edges to a given arbitrary graph so that the resulting graph is a split graph, called a split completion of the input graph. Our purpose is to add an inclusion minimal set of edges to obtain a minimal split completion, which means that no proper subset of the added edges is sufficient to create a split completion. Minimal completions of arbitrary graphs into chordal graphs have been studied previously, and new results have been added continuously. There is an increasing interest in minimal completion problems, and minimal completions of arbitrary graphs into interval graphs have been studied very recently. We extend these previous results to split graphs, and we give a characterization of minimal split completions, along with a linear time algorithm for computing a minimal split completion of an arbitrary input graph. Among our results is a new way of partitioning the vertices of a split graph uniquely into three subsets.
This work is supported by the Research Council of Norway through grant 166429/V30.
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
Berry, A., Bordat, J.-P., Heggernes, P., Simonet, G., Villanger, Y.: A wide-range algorithm for minimal triangulation from an arbitrary ordering. J. Algorithms (to appear)
Blair, J.R.S., Heggernes, P., Telle, J.A.: A practical algorithm for making filled graphs minimal. Theor. Comput. Sci. 250, 125–141 (2001)
Földes, S., Hammer, P.L.: Split graphs. Congressus Numerantium 19, 311–315 (1977)
Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1978)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)
Hammer, P.L., Simeone, B.: The splittance of a graph. Combinatorica 1(3), 275–284 (1981)
Heggernes, P.: Minimal triangulations of graphs - a survey. Dicrete Mathematics (to appear)
Heggernes, P., Suchan, K., Todinca, I., Villanger, Y.: Minimal interval completions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 403–414. Springer, Heidelberg (2005) (to appear)
Heggernes, P., Telle, J.A., Villanger, Y.: Computing minimal triangulations in time O(nα log n) = o(n2.376). In: Proceedings of SODA 2005 - 16th Annua ACM-SIAM Symposium on Discrete Algorithms, pp. 907–916 (2005)
Kratsch, D., Spinrad, J.: Spinrad. Between O(nm) and O(nα). In: Proceedings of SODA 2003 - 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 709–716 (2003)
Kratsch, D., Spinrad, J.: Minimal fill in o(n3) time (2004) (submitted)
Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Disc. Appl. Math. 113, 109–128 (2001)
Rose, D., Tarjan, R.E., Lueker, G.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 146–160 (1976)
Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Alg. Disc. Meth. 2, 77–79 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heggernes, P., Mancini, F. (2006). Minimal Split Completions of Graphs. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_55
Download citation
DOI: https://doi.org/10.1007/11682462_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)