Dominating set - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2013-01-31 16:33:06 NP-complete problems Analysis of algorithms Parameterized complexity Dominating set Kernelization Vertex cover Path decomposition Tree decomposition Time complexity Theoretical computer science Computational complexity theory Graph theory		Add to Reading List Source URL: fpt.wdfiles.com Download Document from Source Website File Size: 192,82 KB Share Document on Facebook

	Lower bounds for polynomial kernelization Michal Pilipczuk Institute of Informatics, University of Warsaw, Poland Parameterized Complexity Summer School DocID: 1uKug - View Document
	Kernelization using structural parameters on sparse graph classes ˇ 1 Jan Obdržálek1 Jakub Gajarský1 Petr Hlinený 1 Sebastian Ordyniak DocID: 1unGd - View Document
	Kernelization: The basics Bart M. P. Jansen Parameterized Complexity Summer School @ Vienna September 2nd 2017, Vienna, Austria DocID: 1u4am - View Document
	Fixed-parameter tractability of multicut parameterized by the size of the cutset Dániel Marx Humboldt-Universität zu Berlin (Joint work with Igor Razgon) WorKer 2010: Workshop on Kernelization DocID: 1tUWX - View Document
	Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams Rajesh Chitnis∗ Graham Cormode† Hossein Esfandiari‡ § DocID: 1toHN - View Document