Back to Results
First PageMeta Content
Connectivity / Vertex / Degree / Random graph / Graph operations / Pseudoforest / Graph theory / Graph / Planar graph


Graphical Properties of Easily Localizable Sensor Networks Brian D O Anderson ∗
Add to Reading List

Open Document

File Size: 272,65 KB

Share Result on Facebook

City

New Haven / /

Country

United States / Canada / Australia / /

Facility

York University / Australian National University / Columbia University / Yale University / /

IndustryTerm

Sensor networks / cosine law / depth-first search algorithm / random network / cosine law idea / sensor network / /

Organization

National Institute of Health / Department of Computer Science / United States Army / Australian Government’s Department of Communications / Information Technology and the Arts / US National Science Foundation / York University / Toronto / Australian National University / Canberra / ICT Centre of Excellence Program / Australian Research Council / Department of Electrical Engineering / Research School of Information Sciences and Engineering / Yale University / Department of Mathematics and Statistics / Columbia University / New York / /

Person

Richard Yang / Peter N Belhumeur / David K Goldenberg / Walter Whiteley / Brian D O Anderson / /

ProgrammingLanguage

R / K / /

ProvinceOrState

New York / Connecticut / /

Technology

Information Technology / 2.3 An algorithm / depth-first search algorithm / simulation / /

SocialTag