Abstract
Deleting a minimum number of vertices from a graph to obtain a proper interval graph is an NP-complete problem. At WG 2010 van Bevern et al. gave an O((14k + 14)k + 1 kn 6) time algorithm by combining iterative compression, branching, and a greedy algorithm. We show that there exists a simple greedy O(n + m) time algorithm that solves the Proper Interval Vertex Deletion problem on \(\{claw,net,\allowbreak tent,\allowbreak C_4,C_5,C_6\}\)-free graphs. Combining this with branching on the forbidden structures \(claw,net,tent,\allowbreak C_4,C_5,\) and C 6 enables us to get an O(kn 6 6k) time algorithm for Proper Interval Vertex Deletion, where k is the number of deleted vertices.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brandstädt, A., Dragan, F.F.: On linear and circular structure of (claw, net)-free graphs. Discrete Applied Mathematics 129, 285–303 (2003)
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. In: Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1999)
Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58, 171–176 (1996)
Cao, Y., Chen, J., Liu, Y.: On feedback vertex set new measure and new structures. In: Kaplan, H. (ed.) Algorithm Theory - SWAT 2010. LNCS, vol. 6139, pp. 93–104. Springer, Heidelberg (2010)
Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 238–249. Springer, Heidelberg (2006)
Courcelle, B.: Graph rewriting: an algebraic and logic approach, pp. 193–242 (1990)
Deng, X., Hell, P., Huang, J.: Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs. SIAM J. Comput. 25, 390–403 (1996)
Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory, Ser. B 16, 47–56 (1974)
Kratsch, D., Müller, H., Todinca, I.: Feedback vertex set on AT-free graphs. Discrete Applied Mathematics 156, 1936–1947 (2008)
Lekkerkerker, C., Boland, J.: Representation of a finite graph by a set of intervals on the real line. Fundamentals of Math. 51, 45–64 (1962)
Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20, 219–230 (1980)
Lokshtanov, D.: Wheel-free deletion is W[2]-hard. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 141–147. Springer, Heidelberg (2008)
Marx, D.: Chordal deletion is fixed-parameter tractable. Algorithmica 57, 747–768 (2010)
Rose, D.J., Tarjan, R., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 266–283 (1976)
Tucker, A.: Structure theorems for some circular-arc graphs. Discrete Mathematics 7, 167–195 (1974)
van Bevern, R., Komusiewicz, C., Moser, H., Niedermeier, R.: Measuring indifference: Unit interval vertex deletion. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 232–243. Springer, Heidelberg (2010)
Villanger, Y., Heggernes, P., Paul, C., Telle, J.A.: Interval completion is fixed parameter tractable. SIAM J. Comput. 38, 2007–2020 (2009)
G. Wegner, Eigenschaften der Nerven homologisch-einfacher Familien im Rn, PhD thesis, Dissertation Gttingen (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Villanger, Y. (2010). Proper Interval Vertex Deletion. In: Raman, V., Saurabh, S. (eds) Parameterized and Exact Computation. IPEC 2010. Lecture Notes in Computer Science, vol 6478. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17493-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-17493-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17492-6
Online ISBN: 978-3-642-17493-3
eBook Packages: Computer ScienceComputer Science (R0)