Dominating set - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2004-10-18 03:25:13 NP-complete problems Analysis of algorithms Parameterized complexity Planar graphs Graph operations Bidimensionality Apex graph Tree decomposition Dominating set Graph theory Theoretical computer science Mathematics		Add to Reading List Source URL: erikdemaine.org Download Document from Source Website File Size: 256,55 KB Share Document on Facebook

	Minimal Disconnected Cuts in Planar Graphs ? Marcin Kami´ nski1 , Dani¨el Paulusma2 , DocID: 1pSEP - View Document
	Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface Petr Hlinˇ en´ y1 and Markus Chimani2 1 DocID: 17QQE - View Document
	A Tighter Insertion-based Approximation of the Crossing Number Markus Chimani⋆1 and Petr Hlinˇen´ y⋆⋆ 2 1 DocID: 17zx5 - View Document
	Weizmann Institute of Science Thesis for the degree Master of Science Submitted to the Scientific Council of the Weizmann Institute of Science Rehovot, Israel DocID: 16bav - View Document
	Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs DocID: 13hhP - View Document