Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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
Document Date: 2016-02-04 05:53:38
Open Document
File Size: 68,17 KB
Share Result on Facebook
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