Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
All Sites
Top Users
Digests
Thang Dinh
Richmond, VA
http://www.people.vcu.edu/~tndinh/
Connectivity Theory Investigator
top
accounts
reputation
activity
subscriptions
Top Questions
12
votes
Directed Sparsest Cut on Planar Graphs?
ds.algorithms
reference-request
graph-theory
planar-graphs
asked Aug 2, 2011 at 5:38
cstheory.stackexchange.com
Top Answers
7
Is it NP-Complete to determine if a quadratic program (QP) has multiple solutions?
cstheory.stackexchange.com
6
Given the set of length of triangle, find the Maximum Area Triangle
cstheory.stackexchange.com
5
Approximation algorithms for dominating set problem
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com