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 suchAdd to Reading ListSource URL: iti.mff.cuni.czDownload Document from Source WebsiteFile Size: 68,17 KBShare Document on Facebook |