Stack Exchange
log in
chat
meta
about
Stack Exchange
All Sites
Hot Questions
Top Users
Newsletters
Blogs
Gabor Retvari
top
accounts
reputation
activity
favorites
subscriptions
Top Questions
19
votes
Minimum chordless odd-cycle graph completion: is it NP-hard?
cc.complexity-theory
reference-request
graph-theory
np-hardness
asked Mar 26 '12 at 20:33
cstheory.stackexchange.com
Top Answers
6
On the faces of the multicommodity flow polytope
cstheory.stackexchange.com
5
Computing distances with approximation less than 2 in general graphs?
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com
