Back to Results
First PageMeta Content
Spanning tree / Combinatorial optimization / Matching / Minimum spanning tree / Graph / NP-complete problems / Graph theory / Theoretical computer science / Mathematics


Dynamic Graphs in the Sliding-Window Model? Michael S. Crouch, Andrew McGregor, and Daniel Stubbs University of Massachusetts Amherst 140 Governors Drive, Amherst, MA 01003 {mcc,mcgregor,dstubbs}@cs.umass.edu
Add to Reading List

Document Date: 2013-06-23 17:01:11


Open Document

File Size: 229,87 KB

Share Result on Facebook

Company

ABC / /

Currency

pence / /

/

Facility

Daniel Stubbs University of Massachusetts Amherst / /

IndustryTerm

k-connectivity algorithm / above algorithms / present algorithms / semi-streaming algorithms / sublinear space stream algorithm / web-pages / semi-streaming algorithm / above algorithm / approximation algorithm / connectivity algorithm / greedy algorithm / maximum cardinality algorithm / /

Organization

National Science Foundation / Daniel Stubbs University of Massachusetts Amherst / /

Person

Andrew McGregor / Ai / Michael S. Crouch / /

ProvinceOrState

British Columbia / /

Technology

greedy algorithm / semi-streaming algorithm / above algorithms / sliding-window algorithm / above algorithm / also present algorithms / maximum cardinality algorithm / connectivity algorithm / k-connectivity algorithm / approximation algorithm / following greedy algorithm / semi-streaming algorithms / sublinear space stream algorithm / /

SocialTag