Stack Exchange
log in
chat
meta
about
Stack Exchange
All Sites
Hot Questions
Top Users
Newsletters
Blogs
Justin Kilpatrick
top
accounts
reputation
activity
favorites
subscriptions
Top Questions
13
votes
Does an algorithm exist to efficiently maintain connectedness information for a DAG in presence of inserts/deletes?
ds.algorithms
graph-algorithms
directed-acyclic-graph
online-algorithms
asked Feb 26 '11 at 23:18
cstheory.stackexchange.com
Top Answers
No answers with score of 5 or more
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com
