Years and Authors of Summarized Original Work
2012; Fomin, Lokshtanov, Misra, Saurabh
2013; Kim, Langer, Paul, Reidl, Rossmanith, Sau, Sikdar
Problem Definition
Several combinatorial optimization problems on graphs involve identifying a subset of nodes S, of the smallest cardinality, such that the graph obtained after removing S satisfies certain properties. For example, the Vertex Cover problem asks for a minimum-sized subset of vertices whose removal makes the graph edgeless, while the Feedback Vertex Set problem involves finding a minimum-sized subset of vertices whose removal makes the graph acyclic. The \(\mathcal{F}\)-Deletion problem is a generic formulation that encompasses several problems of this flavor.
Let \(\mathcal{F}\) be a finite set of graphs. In the \(\mathcal{F}\)-Deletion problem, the input is an n-vertex graph G and an integer k, and the question is if G has a subset S of at most k vertices, such that G − S does not contain a graph from \(\mathcal{F}\)as a minor....
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
Recommended Reading
Bodlaender HL (1997) Treewidth: algorithmic techniques and results. In: 22nd international symposium on mathematical foundations of computer science (MFCS), Bratislava, vol 1295, pp 19–36
Bodlaender HL, Fomin FV, Lokshtanov D, Penninkx E, Saurabh S, Thilikos DM (2009) (Meta) kernelization. In: Proceedings of the 50th annual IEEE symposium on foundations of computer science (FOCS), Atlanta, pp 629–638
Fellows MR, Langston MA (1988) Nonconstructive tools for proving polynomial-time decidability. J ACM 35(3):727–739
Fellows MR, Langston MA (1989) An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations (extended abstract). In: Proceedings of the 30th annual IEEE symposium on foundations of computer science (FOCS), Research Triangle Park, pp 520–525
Fomin FV, Lokshtanov D, Saurabh S, Thilikos DM (2010) Bidimensionality and kernels. In: Proceedings of the twenty-first annual ACM-SIAM symposium on discrete algorithms (SODA), Austin, pp 503–510
Fomin FV, Lokshtanov D, Misra N, Philip G, Saurabh S (2011) Hitting forbidden minors: approximation and kernelization. In: Proceedings of the 8th international symposium on theoretical aspects of computer science (STACS), LIPIcs, Dortmund, vol 9, pp 189–200
Fomin FV, Lokshtanov D, Raman V, Saurabh S (2011) Bidimensionality and EPTAS. In: Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms (SODA), San Francisco. SIAM, pp 748–759
Fomin FV, Lokshtanov D, Misra N, Saurabh S (2012) Planar F-deletion: approximation, kernelization and optimal FPT algorithms. In: Proceedings of the 2012 IEEE 53rd annual symposium on foundations of computer science, New Brunswick, pp 470–479
Fomin FV, Lokshtanov D, Saurabh S (2012) Bidimensionality and geometric graphs. In: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms (SODA), Kyoto. SIAM, pp 1563–1575
Jansen BMP, Lokshtanov D, Saurabh S (2014) A near-optimal planarization algorithm. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms, (SODA), Portland, pp 1802–1811
Kim EJ, Langer A, Paul C, Reidl F, Rossmanith P, Sau I, Sikdar S (2013) Linear kernels and single-exponential algorithms via protrusion decompositions. In: Proceedings of the 40th international colloquium on automata, languages, and programming (ICALP), Riga, Part I, pp 613–624
Langer A, Reidl F, Rossmanith P, Sikdar S (2012) Linear kernels on graphs excluding topological minors. CoRR abs/1201.2780
Lokshtanov D, Misra N, Saurabh S (2012) Kernelization – preprocessing with a guarantee. In: Bodlaender HL, Downey R, Fomin FV, Marx D (eds) The multivariate algorithmic revolution and beyond. Bodlaender, HansL. and Downey, Rod and Fomin, FedorV. and Marx, Dániel (eds) Lecture notes in computer science, vol 7370. Springer, Berlin/Heidelberg, pp 129–161
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Misra, N. (2016). Kernelization, Planar F-Deletion. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_527
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_527
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering