Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http: www.disco.ethz.ch publications planarmds_-1.p - Dominating set - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-09-26 08:36:22 Graph theory NP-complete problems Maximal independent set Independent set Dominating set Vertex cover Graph coloring Planar graph Graph minor Planar separator theorem Tree decomposition		Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p Add to Reading List Source URL: disco.ethz.ch Download Document from Source Website File Size: 412,96 KB Share Document on Facebook

	„ ´ Strengthening Erdos–Posa Property for Minor-Closed Graph Classes Fedor V. Fomin,1 Saket Saurabh,2 and Dimitrios M. Thilikos3 DocID: 1sVvX - View Document
	Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos DocID: 1rq3s - View Document
	Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA { DocID: 1revt - View Document
	Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory DocID: 1rcqn - View Document
	CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS STRUCTURE AND COMPLEXITY DocID: 1r79Q - View Document