![Applied mathematics / NP-complete problems / Dominating set / Random graph / Connectivity / Graph / Theoretical computer science / Mathematics / Graph theory Applied mathematics / NP-complete problems / Dominating set / Random graph / Connectivity / Graph / Theoretical computer science / Mathematics / Graph theory](https://www.pdfsearch.io/img/b81a51c2e6257b3331de528a976c4172.jpg) Date: 2005-07-06 08:19:04Applied mathematics NP-complete problems Dominating set Random graph Connectivity Graph Theoretical computer science Mathematics Graph theory | | Comparison of Two CDS Algorithms on Random Unit Ball Graphs Jennie C. Hansen∗ Abstract This paper compares asymptotic “average case”performance of two closely related algorithms for finding small connected dominatiAdd to Reading ListSource URL: www.siam.orgDownload Document from Source Website File Size: 210,73 KBShare Document on Facebook
|