Constant-factor approximation of domination number in sparse graphs Zdenˇek Dvoˇra´ k∗ Abstract The k-domination number of a graph is the minimum size of a set X such

First Page		Document Content
Date: 2016-02-04 05:53:38		Constant-factor approximation of domination number in sparse graphs Zdenˇek Dvoˇra´ k∗ Abstract The k-domination number of a graph is the minimum size of a set X such Add to Reading List Source URL: iti.mff.cuni.cz Download Document from Source Website File Size: 68,17 KB Share Document on Facebook