Back to Results
First PageMeta Content



Memory Efficient Anonymous Graph Exploration 1 Leszek Gasieniec ˛ Tomasz Radzik2
Add to Reading List

Document Date: 2008-10-11 11:10:55


Open Document

File Size: 147,18 KB

Share Result on Facebook

City

Liverpool / /

Company

Saks / /

Country

United Kingdom / /

/

Facility

University of Liverpool / King’s College / /

IndustryTerm

exponential-time solution / probabilistic solutions / Internet search engines / search environment / deterministic log-space algorithm / randomised log-space algorithm / transportation / manufacturing / software agents / well connected network / large network / important tool / exploration algorithms / space deterministic algorithm / graph exploration algorithms / depth-first search / /

Organization

King’s College London / University of Liverpool / Department of Computer Science / /

Person

Spencer / Cooper / James Propp / /

Position

coupon collector / collector / /

Technology

space deterministic algorithm / graph exploration algorithms / exploration algorithms / peer-to-peer / randomised log-space algorithm / deterministic log-space algorithm / /

SocialTag