Back to Results
First PageMeta Content
Applied 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 dominati
Add to Reading List

Document Date: 2005-07-06 08:19:04


Open Document

File Size: 210,73 KB

Share Result on Facebook

City

Rome / /

Company

Oxford University Press / Mobile Ad Hoc Networks / Distributed Systems / Random Plane Networks / Vertex / Wireless Ad Hoc Networks / Multihop Ad Hoc Wireless Networks / Ad Hoc Wireless Networks / /

Country

Italy / /

Currency

pence / /

Facility

Drexel University / /

IndustryTerm

dimensional wireless networks / wireless network / broadcast protocols / related algorithms / wireless networks / /

NaturalFeature

Random channel / /

Organization

Introduction Unit / Oxford University / Drexel University / /

Person

Li Sheng / Eric Schmutz / C.J. Colburn / Gn / Ron Perline / B.N. Clark / Patricia Stamets / D.J.Johnson / /

Position

Prime Minister / model / D.J. / /

ProgrammingLanguage

Hoc / /

PublishedMedium

Journal of Communications and Networks / Lecture Notes in Computer Science / /

Technology

Extended Localized Algorithm / MOBILE Computing / Approximation algorithms / Coordination Algorithm / closely related algorithms / /

SocialTag