Stack Exchange
log in
chat
meta
about
Stack Exchange
All Sites
Hot Questions
Top Users
Newsletters
Blogs
Martin Vatshelle
top
accounts
reputation
activity
favorites
subscriptions
Top Questions
10
votes
Computing the union closure
co.combinatorics
graph-algorithms
clique
independence
asked Nov 10 '12 at 0:56
cstheory.stackexchange.com
8
votes
How fast can we compute the set inclusion poset of a set family?
graph-algorithms
ds.data-structures
partial-order
asked Apr 25 at 22:02
cstheory.stackexchange.com
Top Answers
10
Approximation algorithms for Maximum Independent Set on special classes of graphs
cstheory.stackexchange.com
7
Constraint satisfaction problem on a graph
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled